Publication:5554980
From MaRDI portal
zbMath0168.25902MaRDI QIDQ5554980
Publication date: 1966
Related Items
On the Size of Two-Way Reasonable Automata for the Liveness Problem, Operations on Unambiguous Finite Automata, State Complexity of Projected Languages, Descriptional Complexity of the Forever Operator, Nondeterministic state complexity of star-free languages, An alternating hierarchy for finite automata, On a structural property in the state complexity of projected regular languages, Optimal simulation of self-verifying automata by deterministic automata, A family of NFAs which need 2\(^{n}-\alpha\) deterministic states, Oblivious two-way finite automata: decidability and complexity, More on deterministic and nondeterministic finite cover automata, Magic numbers in the state hierarchy of finite automata, Operations on Unambiguous Finite Automata, More on Deterministic and Nondeterministic Finite Cover Automata, Translation from classical two-way automata to pebble two-way automata