A. Rubtsov

On Computational Complexity of Set Automata pdf

Mikhail N. Vyalyi, Alexander A. Rubtsov, M. Vyalyi, 2017, DLT.

A Linear-Time Simulation of Deterministic d-Limited Automata

Alexander A. Rubtsov, A. Rubtsov, 2021, DLT.

The Simplest Proof of Parikh's Theorem via Derivation Trees

A. Rubtsov, 2022, arXiv.org.

A Structural Lemma for Deterministic Context-Free Languages

Alexander A. Rubtsov, A. Rubtsov, 2018, DLT.

On regular realizability problems for context-free languages

M. Vyalyi, A. Rubtsov, 2015, Probl. Inf. Transm..