( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Structural Lemma for Deterministic Context-Free Languages.

. DLT, том 11088 из Lecture Notes in Computer Science, стр. 553-565. Springer, (2018)

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.

Alexander A Borbély

Alexander A Bialasiewicz

Alexander Foss°a

Alexander A Beyer

Alexander A Bialasiewicz

 

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

On Computational Complexity of Set Automata., и . DLT, том 10396 из Lecture Notes in Computer Science, стр. 332-344. Springer, (2017)On universality of regular realizability problems., и . CoRR, (2023)Regular realizability problems and regular languages.. CoRR, (2015)On Emptiness and Membership Problems for Set Automata., и . CSR, том 10846 из Lecture Notes in Computer Science, стр. 295-307. Springer, (2018)Regular Realizability Problems and Context-Free Languages., и . DCFS, том 9118 из Lecture Notes in Computer Science, стр. 256-267. Springer, (2015)The Simplest Proof of Parikh's Theorem via Derivation Trees.. CoRR, (2023)A Linear-Time Simulation of Deterministic d-Limited Automata.. DLT, том 12811 из Lecture Notes in Computer Science, стр. 342-354. Springer, (2021)Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration., , , , и . BlackSeaCom, стр. 146-152. IEEE, (2024)Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems., и . DCFS, том 13037 из Lecture Notes in Computer Science, стр. 150-162. Springer, (2021)Computational Model for Parsing Expression Grammars., и . MFCS, том 306 из LIPIcs, стр. 80:1-80:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)