The method of forced enumeration for nondeterministic automata

@article{Szelepcsnyi2004TheMO,
  title={The method of forced enumeration for nondeterministic automata},
  author={R{\'o}bert Szelepcs{\'e}nyi},
  journal={Acta Informatica},
  year={2004},
  volume={26},
  pages={279-284}
}
SummaryEvery family of languages, recognized by nondeterministic L(n) tape-bounded Turing machines, where L(n)≥logn, is closed under complement. As a special case, the family of context-sensitive languages is closed under complement. This solves the open problem from [4]. 
Alternating and empty alternating auxiliary stack automata
Alternatingand empty alternatingauxiliary stack automata
We consider variants of alternatingauxiliary stack automata and characterize their computational power when the number of alternations is bounded by a constant or unlimited. In this way we get new
Resolution of The Linear-Bounded Automata Question
This work resolves a longstanding open question in automata theory, i.e., the linear-bounded automata question ( LBA question for short), which can also be phrased succinctly in the language of
Unambiguous Functions in Logarithmic Space
TLDR
A modification to the standard computation models of Turing machines and configuration graphs is proposed, which allows for unambiguity-preserving composition and defines a notion of reductions (based on function composition), which allows nondeterminism but controls its level of ambiguity.
Towards a Cardinality Theorem for Finite Automata
TLDR
Evidence is gathered that the cardinalitytheorem might also hold for finite automata, which states that a language is recursive if a Turing machine can exclude for any n words one of the n + 1 possibilities for the number of words in the language.
Complement for two-way alternating automata
TLDR
Here it is shown that the cost of complementing is polynomial in n, and this complementary simulation does not eliminate infinite loops.
Descriptional Complexity of Pushdown Store Languages
TLDR
An upper bound on the size of an NFA for P(M) is obtained, which is quadratic in the number of states and linear in theNumber of pushdown symbols of M, and this upper bound is shown to be asymptotically optimal.
The Separation of NP and PSPACE
TLDR
This paper shows that NP 6= PSPACE via the premise of NTIME[S(n)] ⊆ DSPACE[S (n)], and then by diagonalization over all polynomial-time nondeterministic Turing machines via universal nondetergetic Turing machine M0 running in O(n ) space for any k ∈ N1.
Computational Complexity of Decision Problems on Self-verifying Finite Automata
TLDR
This paper examines the computational complexity of several decision problems for SVFAs, and concludes that the complexity of (non-)emptiness, universality, and equivalence is comparable to that for deterministic automata.
Logical Characterizations of PSPACE
TLDR
Two, quite different, logical characterizations of the computational complexity class PSPACE on unordered, finite relational structures are presented and the closure of first-order logic under taking partial fixed points and under an operator for nondeterministic choice is novel.
...
...

References

SHOWING 1-5 OF 5 REFERENCES
Nondeterministic Space is Closed Under Complementation
TLDR
It immediately follows that the context-sensitive languages are closed under complementation, thus settling a question raised by Kuroda.
Formal languages and their relation to automata
  • J. Hopcroft, J. Ullman
  • Computer Science
    Addison-Wesley series in computer science and information processing
  • 1969
TLDR
The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory.
Descriptive and Computational Complexity
TLDR
A characterization of nondeterministic polynomial time as the set of properties expressible in first-order logic phs a least fixed point operator and a result that was derived using this approach show that for all s(n) greater than or equal to log n, nondetergetic space s( n) is closed under complementation.
Classes of Languages and Linear-Bounded Automata
The method of Forcing for nondeterministic automata
  • Bull. Eur. Assoc. Theor. Comp. Sci. 33,
  • 1987