Regular realizability problems and models of a generalized nondeterminism - Alexander A. Rubtsov; Mikhail N. Vyalyi (CoRR, 2011)

Regular Realizability Problems and Context-Free Languages. - Alexander A. Rubtsov; Mikhail N. Vyalyi (DCFS, 2015)

Regular realizability problems and regular languages. - Alexander A. Rubtsov (CoRR, 2015)

On regular realizability problems for context-free languages. - Mikhail N. Vyalyi; Alexander A. Rubtsov (Probl. Inf. Transm., 2015)

On Emptiness and Membership Problems for Set Automata. - Alexander A. Rubtsov; Mikhail N. Vyalyi (CSR, 2018)

A Structural Lemma for Deterministic Context-Free Languages. - Alexander A. Rubtsov (DLT, 2018)

Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems. - Alexander A. Rubtsov; Mikhail N. Vyalyi (DCFS, 2021)

A Linear-Time Simulation of Deterministic d-Limited Automata. - Alexander A. Rubtsov (DLT, 2021)

On computational complexity of set automata. - Alexander A. Rubtsov; Mikhail N. Vyalyi (Inf. Comput., 2021)

The Simplest Proof of Parikh's Theorem via Derivation Trees. - Alexander A. Rubtsov (CoRR, 2023)

Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration. - Alexander A. Rubtsov; Bruno Bauwens; Dmitri Shmelkin; Elizaveta Rudenko; Alexey Lavrov (BlackSeaCom, 2024)

Computational Model for Parsing Expression Grammars. - Alexander A. Rubtsov; Nikita Chudinov (MFCS, 2024)

On Universality of Regular Realizability Problems. - Alexander A. Rubtsov; Mikhail N. Vyalyi (Probl. Inf. Transm., 2024)

Disjunctive Complexity. - Nikita Ivanov; Alexander A. Rubtsov; Mikhail N. Vyalyi (DCFS, 2025)