scientific article; zbMATH DE number 3269886
From MaRDI portal
Publication:5554980
zbMath0168.25902MaRDI QIDQ5554980
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
More on Deterministic and Nondeterministic Finite Cover Automata ⋮ A family of NFAs which need 2\(^{n}-\alpha\) deterministic states ⋮ Binary coded unary regular languages ⋮ On the Size of Two-Way Reasonable Automata for the Liveness Problem ⋮ 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 ⋮ Descriptional Complexity of the Forever Operator ⋮ Operations on Unambiguous Finite Automata ⋮ Translation from classical two-way automata to pebble two-way automata ⋮ Magic numbers in the state hierarchy of finite automata ⋮ Oblivious two-way finite automata: decidability and complexity ⋮ Optimal simulation of self-verifying automata by deterministic automata ⋮ State Complexity of Projected Languages ⋮ Operations on Unambiguous Finite Automata ⋮ Descriptional complexity of regular languages ⋮ More on deterministic and nondeterministic finite cover automata