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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Makoto SAKAMOTO, Katsushi INOUE, Itsuo TAKANAMI, "A Two-Way Nondeterministic One-Counter Languages Not Accepted by Nondeterministic Rebound Automata" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 6, pp. 879-881, June 1990, doi: .
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e73-e_6_879/_p
Copy
@ARTICLE{e73-e_6_879,
author={Makoto SAKAMOTO, Katsushi INOUE, Itsuo TAKANAMI, },
journal={IEICE TRANSACTIONS on transactions},
title={A Two-Way Nondeterministic One-Counter Languages Not Accepted by Nondeterministic Rebound Automata},
year={1990},
volume={E73-E},
number={6},
pages={879-881},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - A Two-Way Nondeterministic One-Counter Languages Not Accepted by Nondeterministic Rebound Automata
T2 - IEICE TRANSACTIONS on transactions
SP - 879
EP - 881
AU - Makoto SAKAMOTO
AU - Katsushi INOUE
AU - Itsuo TAKANAMI
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 6
JA - IEICE TRANSACTIONS on transactions
Y1 - June 1990
AB - 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.
ER -