Author of the publication

Growing Context-Sensitive Languages and Church-Rosser Languages.

, and . STACS, volume 900 of Lecture Notes in Computer Science, page 313-324. Springer, (1995)

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

Asynchronous Parallel Communicating Systems of Pushdown Automata.. Int. J. Found. Comput. Sci., 26 (5): 643- (2015)Limited Context Restarting Automata and McNaughton Families of Languages., , and . NCMA, volume 290 of books@ocg.at, page 165-180. Österreichische Computer Gesellschaft, (2012)Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General.. Inf. Process. Lett., 53 (5): 237-242 (1995)Regulated variants of limited context restarting automata., and . Theor. Comput. Sci., (2017)Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class., and . Acta Inf., 28 (5): 477-510 (1991)Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata., and . AFL, page 328-342. (2011)New Results on Deterministic Sgraffito Automata, , and . Developments in Language Theory, page 409--419. Springer, (2013)Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols., , , and . Developments in Language Theory, volume 3572 of Lecture Notes in Computer Science, page 284-295. Springer, (2005)On Deterministic Ordered Restart-Delete Automata.. DLT, volume 11088 of Lecture Notes in Computer Science, page 529-540. Springer, (2018)On Left-Monotone Deterministic Restarting Automata., , , and . Developments in Language Theory, volume 3340 of Lecture Notes in Computer Science, page 249-260. Springer, (2004)