( en | de | ru )

 

Disambiguation of "Rubtsov, Alexander A."

Author of the publication

copydeleteadd this publication to your clipboard
On Computational Complexity of Set Automata.

, and . DLT, volume 10396 of Lecture Notes in Computer Science, page 332-344. Springer, (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 A Borbély

Alexander A Bialasiewicz

Alexander A Beyer

Alexander Foss°a

Alexander A Bialasiewicz

 

Other publications of authors with the same name

On universality of regular realizability problems., and . CoRR, (2023)On Computational Complexity of Set Automata., and . DLT, volume 10396 of Lecture Notes in Computer Science, page 332-344. Springer, (2017)Regular realizability problems and regular languages.. CoRR, (2015)The Simplest Proof of Parikh's Theorem via Derivation Trees.. CoRR, (2023)Regular Realizability Problems and Context-Free Languages., and . DCFS, volume 9118 of Lecture Notes in Computer Science, page 256-267. Springer, (2015)On Emptiness and Membership Problems for Set Automata., and . CSR, volume 10846 of Lecture Notes in Computer Science, page 295-307. Springer, (2018)A Structural Lemma for Deterministic Context-Free Languages.. DLT, volume 11088 of Lecture Notes in Computer Science, page 553-565. Springer, (2018)Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems., and . DCFS, volume 13037 of Lecture Notes in Computer Science, page 150-162. Springer, (2021)Computational Model for Parsing Expression Grammars., and . MFCS, volume 306 of LIPIcs, page 80:1-80:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Linear-Time Simulation of Deterministic d-Limited Automata.. DLT, volume 12811 of Lecture Notes in Computer Science, page 342-354. Springer, (2021)