On Models of a Nondeterministic Computation

DOI10.1007/978-3-642-03351-3_31zbMath1248.68198MaRDI QIDQ3392968

Mikhail N. Vyalyi

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_31

zbMATH Keywords

nondeterminism; automaton; complexity class

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

On regular realizability problems, Orbits of Linear Maps and Regular Languages, On Models of a Nondeterministic Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Finite model theory and its applications.
• On the power of synchronization in parallel computations
• A communication hierarchy of parallel computations
• Alternating and empty alternating auxiliary stack automata.
• Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
• Undecidability on quantum finite automata
• Theory of Formal Systems. (AM-47)
• On Models of a Nondeterministic Computation
• Tree-Walking Automata
• Alternation
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers