Alexander A. Rubtsov

Orcid: 0000-0001-8850-9749

According to our database1, Alexander A. Rubtsov authored at least 13 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computational Model for Parsing Expression Grammars.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration.
Proceedings of the IEEE International Black Sea Conference on Communications and Networking, 2024

2023
On universality of regular realizability problems.
CoRR, 2023

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

2021
On computational complexity of set automata.
Inf. Comput., 2021

A Linear-Time Simulation of Deterministic d-Limited Automata.
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems.
Proceedings of the Descriptional Complexity of Formal Systems, 2021

2018
A Structural Lemma for Deterministic Context-Free Languages.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

On Emptiness and Membership Problems for Set Automata.
Proceedings of the Computer Science - Theory and Applications, 2018

2015
On regular realizability problems for context-free languages.
Probl. Inf. Transm., 2015

Regular realizability problems and regular languages.
CoRR, 2015

Regular Realizability Problems and Context-Free Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2011
Regular realizability problems and models of a generalized nondeterminism
CoRR, 2011


  Loading...