( en | de | ru )

 

Disambiguation of "Thomas, Richard M."

Author of the publication

copydeleteadd this publication to your clipboard
Monoid presentations of groups by finite special string-rewriting systems.

, , and . RAIRO Theor. Informatics Appl., 38 (3): 245-256 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Richard M Young

Richard M DCamp

Richard M Gross

Richard Thomas

Thomas M Klapötke

 

Other publications of authors with the same name

Groups with a Recursively Enumerable Irreducible Word Problem., and . FCT, volume 8070 of Lecture Notes in Computer Science, page 283-292. Springer, (2013)Groups Whose Word Problem is a Petri Net Language., and . DCFS, volume 9118 of Lecture Notes in Computer Science, page 243-255. Springer, (2015)Space Complexity and Word Problems of Groups., and . Groups Complexity Cryptology, 1 (2): 261-273 (2009)Automatic Presentations and Semigroup Constructions., , , and . Theory Comput. Syst., 47 (2): 568-592 (2010)Unary FA-Presentable Semigroups., , and . Int. J. Algebra Comput., (2012)Automatic presentations for semigroups., , , and . Inf. Comput., 207 (11): 1156-1168 (2009)Biautomatic Semigroups., and . FCT, volume 3623 of Lecture Notes in Computer Science, page 56-67. Springer, (2005)Semigroups with a Context-Free Word Problem., , , and . Developments in Language Theory, volume 7410 of Lecture Notes in Computer Science, page 97-108. Springer, (2012)Context-Sensitive Decision Problems in Groups., and . Developments in Language Theory, volume 3340 of Lecture Notes in Computer Science, page 296-307. Springer, (2004)Word problems of groups: Formal languages, characterizations and decidability., and . Theor. Comput. Sci., (2018)