Alexander A. Rubtsov

According to our database, Alexander A. Rubtsov authored at least 11 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

On universality of regular realizability problems.

Alexander A. Rubtsov, Michael N. Vyalyi

CoRR, 2023

The Simplest Proof of Parikh's Theorem via Derivation Trees.

Alexander A. Rubtsov

CoRR, 2023

2021

On computational complexity of set automata.

Alexander A. Rubtsov, Mikhail N. Vyalyi

Inf. Comput., 2021

A Linear-Time Simulation of Deterministic d-Limited Automata.

Alexander A. Rubtsov

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems.

Alexander A. Rubtsov, Mikhail N. Vyalyi

Proceedings of the Descriptional Complexity of Formal Systems, 2021

2018

A Structural Lemma for Deterministic Context-Free Languages.

Alexander A. Rubtsov

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

On Emptiness and Membership Problems for Set Automata.

Alexander A. Rubtsov, Mikhail N. Vyalyi

Proceedings of the Computer Science - Theory and Applications, 2018

2015

On regular realizability problems for context-free languages.

Mikhail N. Vyalyi, Alexander A. Rubtsov

Probl. Inf. Transm., 2015

Regular realizability problems and regular languages.

Alexander A. Rubtsov

CoRR, 2015

Regular Realizability Problems and Context-Free Languages.

Alexander A. Rubtsov, Mikhail N. Vyalyi

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2011

Regular realizability problems and models of a generalized nondeterminism

Alexander A. Rubtsov, Mikhail N. Vyalyi

CoRR, 2011