Alternation in simple devices

DOI10.1007/3-540-60084-1_84zbMath1412.68134OpenAlexW1584745362MaRDI QIDQ4645188

No author found.

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_84

zbMATH Keywords

finite automatoncomputation treeunary languageinput lengthinput tape

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Low complexity classes of multidimensional cellular automata

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Alternating multihead finite automata
• Possibilities of various types of alternating automata
• k + 1 Heads Are Better than k
• On Multi-Head Finite Automata
• Multi-tape and multi-head pushdown automata
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternation in simple devices