Author of the publication

Restarting Transducers, Regular Languages, and Rational Relations.

, and . Theory Comput. Syst., 57 (1): 195-225 (2015)

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

Regulated variants of limited context restarting automata., and . Theor. Comput. Sci., (2017)Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General.. Inf. Process. Lett., 53 (5): 237-242 (1995)Limited Context Restarting Automata and McNaughton Families of Languages., , and . NCMA, volume 290 of books@ocg.at, page 165-180. Österreichische Computer Gesellschaft, (2012)Two-Head Finite-State Acceptors with Translucent Letters., and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 406-418. Springer, (2019)New Results on Deterministic Sgraffito Automata., , and . Developments in Language Theory, volume 7907 of Lecture Notes in Computer Science, page 409-419. Springer, (2013)On Shrinking Restarting Automata of Window Size One and Two., and . DLT, volume 11647 of Lecture Notes in Computer Science, page 140-153. Springer, (2019)Overlaps in Free Partially Commutative Monoids., and . J. Comput. Syst. Sci., 42 (2): 186-198 (1991)Globally Deterministic CD-Systems of Stateless R(1)-Automata., and . LATA, volume 6638 of Lecture Notes in Computer Science, page 390-401. Springer, (2011)A Survey on Automata with Translucent Letters.. CIAA, volume 14151 of Lecture Notes in Computer Science, page 21-50. Springer, (2023)Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata.. DCFS, volume 7386 of Lecture Notes in Computer Science, page 244-251. Springer, (2012)