A note on self-modifying finite automata

DOI10.1016/S0020-0190(99)00127-1zbMath0953.68566WikidataQ126321804 ScholiaQ126321804MaRDI QIDQ1583051

Yue Wang, Akira Ito, Katsushi Inoue, Tokio Okazaki

Publication date: 26 October 2000

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

formal languagestheory of computationone-way nonerasing stack automataSelf-modifying finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Self-modifying finite automata: An introduction
• One-way stack automata
• Sets accepted by one-way stack automata are context sensitive
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

This page was built for publication: A note on self-modifying finite automata