Possibilities of various types of alternating automata

DOI10.1007/BF01068687zbMath0644.68057OpenAlexW2327496174MaRDI QIDQ3787476

M. Ya. Alberts

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068687

zbMATH Keywords

Turing machinesfinite automatapushdown automataalternating automatacomplexity classes of languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10)

Related Items (1)

Alternation in simple devices

Cites Work

• Selection of digitivity of numbers in the transmission of data concerning the probabilistic characteristics of a process
• Alternation
• On Multi-Head Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Possibilities of various types of alternating automata