( en | de | ru )

 

Disambiguation of "Okhotin, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Conjunctive Categorial Grammars.

, and . MOL, page 140-151. ACL, (2017)

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 Stadler

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

Alexander Auch

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

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

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)Least and Greatest Solutions of Equations over Sets of Integers., and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 441-452. Springer, (2010)Preface., and . Inf. Comput., 259 (2): 161 (2018)State Complexity of Operations on Input-Driven Pushdown Automata., and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 485-496. Springer, (2011)On language equations with concatenation and various sets of Boolean operations.. RAIRO Theor. Informatics Appl., 49 (3): 205-232 (2015)One-Visit Caterpillar Tree Automata., , and . Fundam. Informaticae, 52 (4): 361-375 (2002)State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata., and . Fundam. Informaticae, 110 (1-4): 231-239 (2011)Boolean Grammars.. Developments in Language Theory, volume 2710 of Lecture Notes in Computer Science, page 398-410. Springer, (2003)