scientific article; zbMATH DE number 1405658
From MaRDI portal
Publication:4938639
zbMath0939.68071MaRDI QIDQ4938639
Juraj Hromkovič, Georg Schnitger
Publication date: 25 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata ⋮ Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata ⋮ Unnamed Item ⋮ On the power of randomized multicounter machines ⋮ Unary Self-verifying Symmetric Difference Automata ⋮ Communication complexity method for measuring nondeterminism in finite automata
This page was built for publication:
