3 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.FL2022
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems
Alexander Rubtsov, Mikhail Vyalyi
We consider general computational models: one-way and two-way finite automata, and logarithmic space Turing machines, all equipped with an auxiliary data structure (ADS). The defin…
cs.FL2015★ 2 cited
Regular realizability problems and context-free languages
Alexander A. Rubtsov, Mikhail N. Vyalyi
We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language…
cs.FL2015★ 3 cited
Regular realizability problems and regular languages
Alexander A. Rubtsov
We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language…