On Emptiness and Membership Problems for Set Automata

Rubtsov, Alexander A.; Vyalyi, Mikhail N.

doi:10.1007/978-3-319-90530-3_25

Cited by 2 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assertions (7-8) lead to (3) for the corresponding classes of automata. For (6), we have already obtained the result in [14] in the same way and present in this paper the generalized technique.…”

Section: Our Contributionmentioning

confidence: 89%

“…Set supports the following operations: in(x) : S → S ∪ {x}, out(x) : S → S \ {x}, test(x) : x ? ∈ S. We define the protocol language SA-PROT consistently with [13,14], so the elements of alphabets below are individual symbols while they are words in [13,14].…”

Section: Computational Modelsmentioning

confidence: 99%

“…SA-PROT was defined in Example 8. It was proved in [14] that the problems E-1NSA ∼ log NRR(SA-PROT) are PSPACE-complete. So we obtain (6) by applying Theorem 32.…”

Section: Applicationsmentioning

confidence: 99%

See 2 more Smart Citations

Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems

Rubtsov

Vyalyi

2021

Descriptional Complexity of Formal Systems

Self Cite

View full text Add to dashboard Cite

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 definition of an ADS is based on the language of protocols of work with the ADS. We describe the connection of automata-based models with "Balloon automata" that are another general formalization of automata equipped with an ADS presented by Hopcroft and Ullman in 1967. This definition establishes the connection between the non-emptiness problem for one-way automata with ADS, languages recognizable by nondeterministic log-space Turing machines equipped with the same ADS, and a regular realizability problem (NRR) for the language of ADS' protocols. The NRR problem is to verify whether the regular language on the input has a non-empty intersection with the language of protocols. The computational complexity of these problems (and languages) is the same up to log-space reductions.

show abstract

Section: Our Contributionmentioning

confidence: 89%