A note on rebound automata

DOI10.1016/0020-0255(82)90045-7zbMath0482.68081OpenAlexW2059910571MaRDI QIDQ1162823

Katsushi Inoue, Hiroshi Taniguchi, Itsuo Takanami

Publication date: 1982

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(82)90045-7

zbMATH Keywords

context-free languageclosure propertiesdeterministic rebound automatonnondeterministic rebound automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On the descriptional power of heads, counters, and pebbles ⋮ A NOTE ON REBOUND TURING MACHINES ⋮ Probabilistic rebound Turing machines

Cites Work

• Some properties of two-dimensional on-line tessellation acceptors
• Unnamed Item

This page was built for publication: A note on rebound automata