( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lambda-Confluence Is Undecidable for Clearing Restarting Automata.

, и . CIAA, том 7982 из Lecture Notes in Computer Science, стр. 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.

Friedrich Otto

Friedrich Otto

Friedrich Otto

Friedrich Otto

Friedrich Otto

 

Другие публикации лиц с тем же именем

String-Rewriting Systems., и . Texts and Monographs in Computer Science Springer, (1993)Restarting Transducers, Regular Languages, and Rational Relations., и . Theory Comput. Syst., 57 (1): 195-225 (2015)On a class of rational functions for pictures., , и . NCMA, том 318 из books@ocg.at, стр. 159-176. Österreichische Computer Gesellschaft, (2015)On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems., и . NCMA, том 263 из books@ocg.at, стр. 113-126. Austrian Computer Society, (2010)On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata., , и . LATA, том 5457 из Lecture Notes in Computer Science, стр. 660-671. Springer, (2009)Reversibility for stateless ordered RRWW-automata., и . Acta Informatica, 58 (4): 397-425 (2021)Two-Sided Strictly Locally Testable Languages., , и . Fundam. Informaticae, 180 (1-2): 29-51 (2021)On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems., и . Fundam. Informaticae, 112 (2-3): 219-238 (2011)Church-Rosser Thue systems and formal languages., , и . J. ACM, 35 (2): 324-344 (1988)Decidable Sentences for Context-Free Groups., и . STACS, том 480 из Lecture Notes in Computer Science, стр. 160-171. Springer, (1991)