A Two-Way Nondeterministic One-Counter Languages Not Accepted by Nondeterministic Rebound Automata

Makoto SAKAMOTO, Katsushi INOUE, Itsuo TAKANAMI

  • Full Text Views

    0

  • Cite this

Summary :

It was unknown whether there exists a language accepted by a two-way nondeterministic one counter automaton, but not accepted by any nondeterministic rebound automaton. This paper solves this problem, and shows that there exists such a language.

Publication
IEICE TRANSACTIONS on transactions Vol.E73-E No.6 pp.879-881
Publication Date
1990/06/25
Publicized
Online ISSN
DOI
Type of Manuscript
LETTER
Category
Automaton, Language and Theory of Computing

Authors

Keyword

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.