scientific article; zbMATH DE number 3305070
From MaRDI portal
Publication:5586371
zbMath0192.08104MaRDI QIDQ5586371
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Finite automata and unary languages ⋮ Automaticity. II: Descriptional complexity in the unary case ⋮ Unambiguous finite automata over a unary alphabet ⋮ Binary coded unary regular languages ⋮ On a structural property in the state complexity of projected regular languages ⋮ Magic numbers in the state hierarchy of finite automata ⋮ Unary finite automata vs. arithmetic progressions ⋮ State Complexity of Projected Languages ⋮ Determination of systems of graphs and the synthesis of finite automata ⋮ Wielandt-type bounds for primitive mappings of partially ordered sets ⋮ Magic Numbers and Ternary Alphabet
This page was built for publication:
