Alternation in simple devices

DOI10.1007/3-540-60084-1_84MaRDI QIDQ4645188zbMATH OpenOpenAlexFDO

Authors

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

computation treefinite automatoninput lengthinput tapeunary language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1931697
• Simple circuits are not that simple
• Horseshoes in a class of simple circuits
• scientific article; zbMATH DE number 1499084
• A bifurcation analysis of a simple electronic circuit
• Circuit principles and weak pigeonhole variants
• Alternators on uniform rings of odd size
• Regular switching components
• Elegant Circuits

Cites work

• k + 1 Heads Are Better than k
• Alternating multihead finite automata
• scientific article; zbMATH DE number 4172381 (Why is no real title available?)
• scientific article; zbMATH DE number 4213434 (Why is no real title available?)
• scientific article; zbMATH DE number 3936519 (Why is no real title available?)
• Multi-tape and multi-head pushdown automata
• On Multi-Head Finite Automata
• Possibilities of various types of alternating automata
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines

Cited in

(6)

• A note on emptiness for alternating finite automata with a one-letter alphabet
• scientific article; zbMATH DE number 4172381 (Why is no real title available?)
• scientific article; zbMATH DE number 4213434 (Why is no real title available?)
• Possibilities of various types of alternating automata
• Simple circuits are not that simple
• Low complexity classes of multidimensional cellular automata

This page was built for publication: Alternation in simple devices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645188)