Modified One-Way Alternating Pushdown Automata and Indexed Languages
Summary :
A partitioning automaton which is a modified version of the alternating automaton is introduced. The machine can partition the input string into some blocks and check them universally. The classes of languages accepted by partitioning finite automata and partitioning pushdown automata are shown to be equivalent to the classes of CFL and Aho's indexed languages, respectivery.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E69-E No.11 pp.1213-1216
- Publication Date
- 1986/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Software Technology
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Masao IKEKAWA, Takumi KASAI, "Modified One-Way Alternating Pushdown Automata and Indexed Languages" in IEICE TRANSACTIONS on transactions,
vol. E69-E, no. 11, pp. 1213-1216, November 1986, doi: .
Abstract: A partitioning automaton which is a modified version of the alternating automaton is introduced. The machine can partition the input string into some blocks and check them universally. The classes of languages accepted by partitioning finite automata and partitioning pushdown automata are shown to be equivalent to the classes of CFL and Aho's indexed languages, respectivery.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e69-e_11_1213/_p
Copy
@ARTICLE{e69-e_11_1213,
author={Masao IKEKAWA, Takumi KASAI, },
journal={IEICE TRANSACTIONS on transactions},
title={Modified One-Way Alternating Pushdown Automata and Indexed Languages},
year={1986},
volume={E69-E},
number={11},
pages={1213-1216},
abstract={A partitioning automaton which is a modified version of the alternating automaton is introduced. The machine can partition the input string into some blocks and check them universally. The classes of languages accepted by partitioning finite automata and partitioning pushdown automata are shown to be equivalent to the classes of CFL and Aho's indexed languages, respectivery.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Modified One-Way Alternating Pushdown Automata and Indexed Languages
T2 - IEICE TRANSACTIONS on transactions
SP - 1213
EP - 1216
AU - Masao IKEKAWA
AU - Takumi KASAI
PY - 1986
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E69-E
IS - 11
JA - IEICE TRANSACTIONS on transactions
Y1 - November 1986
AB - A partitioning automaton which is a modified version of the alternating automaton is introduced. The machine can partition the input string into some blocks and check them universally. The classes of languages accepted by partitioning finite automata and partitioning pushdown automata are shown to be equivalent to the classes of CFL and Aho's indexed languages, respectivery.
ER -
English
