( en | de | ru )

 

Disambiguation of "Okhotin, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata.

, and . MFCS (1), volume 8634 of Lecture Notes in Computer Science, page 291-302. Springer, (2014)

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.

Alexander

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)

Alexander Gocht

Methods in economic farm modelling. Uni Bonn, (2009)
 

Other publications of authors with the same name

Efficient Automaton-Based Recognition For Linear Conjunctive Languages.. Int. J. Found. Comput. Sci., 14 (6): 1103-1116 (2003)Preface., and . Inf. Comput., 259 (2): 161 (2018)Expressive Power of LL(k) Boolean Grammars.. FCT, volume 4639 of Lecture Notes in Computer Science, page 446-457. Springer, (2007)On the Expressive Power of GF(2)-Grammars., and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 310-323. Springer, (2019)State Complexity of Operations on Input-Driven Pushdown Automata., and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 485-496. Springer, (2011)Boolean Grammars.. Developments in Language Theory, volume 2710 of Lecture Notes in Computer Science, page 398-410. Springer, (2003)A Tale of Conjunctive Grammars.. DLT, volume 11088 of Lecture Notes in Computer Science, page 36-59. Springer, (2018)Input-driven pushdown automata: nondeterminism and unambiguity., and . NCMA, volume 294 of books@ocg.at, page 31-33. Österreichische Computer Gesellschaft, (2013)State complexity of cyclic shift., and . DCFS, page 182-193. Università degli Studi di Milano, Milan, Italy, (2005)On the Number of Nonterminals in Linear Conjunctive Grammars.. DCFS, page 274-283. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary, (2003)