( en | de | ru )

 

Disambiguation of "Otto, Friedrich"

Author of the publication

copydeleteadd this publication to your clipboard
Lambda-Confluence Is Undecidable for Clearing Restarting Automata.

, and . CIAA, volume 7982 of Lecture Notes in Computer Science, page 256-267. Springer, (2013)

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.

Friedrich Otto

Friedrich Otto

Friedrich Otto

Friedrich Otto

Friedrich Otto

 

Other publications of authors with the same name

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)New Results on Deterministic Sgraffito Automata, , and . Developments in Language Theory, page 409--419. Springer, (2013)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)Two-Head Finite-State Acceptors with Translucent Letters., and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 406-418. Springer, (2019)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)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)