Author of the publication

Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.

, , and . RTA, volume 1232 of Lecture Notes in Computer Science, page 53-67. Springer, (1997)

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.

 

Other publications of authors with the same name

Context-free languages consisting of non-primitive words., and . Int. J. Comput. Math., 40 (3-4): 157-167 (1991)Cross-Sections for Finitely Presented Monoids with Decidable Word Problems., , and . RTA, volume 1232 of Lecture Notes in Computer Science, page 53-67. Springer, (1997)On complexity of finite moore automata.. Acta Cybern., 7 (3): 281-292 (1986)On Termination of Confluent One-Rule String-Rewriting Systems., , and . Inf. Process. Lett., 61 (2): 91-96 (1997)Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions., , and . Theor. Comput. Sci., 301 (1-3): 79-101 (2003)Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems., , and . Journal of Automata, Languages and Combinatorics, 2 (1): 47-73 (1997)Maximal Solid Codes., , and . Journal of Automata, Languages and Combinatorics, 6 (1): 25-50 (2001)Undecidability Results for Monoids with Linear-Time Decidable Word Problems., , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 278-289. Springer, (2000)On a problem of Ádám concerning precodes assigned to finite Moore automata.. Acta Cybern., 8 (2): 143-151 (1987)Undecidable properties of monoids with word problem solvable in linear time., and . Theor. Comput. Sci., 290 (3): 1301-1316 (2003)