On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
From MaRDI portal
Publication:5514601
DOI10.1145/321328.321335zbMath0139.24503OpenAlexW2059359177MaRDI QIDQ5514601
Shigeru Sekiguchi, Kojiro Kobayashi
Publication date: 1966
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321328.321335
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Weak Second‐Order Arithmetic and Finite Automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- Operations Which Preserve Definability in Languages
- Two Families of Languages Related to ALGOL