MAGIC NUMBERS AND TERNARY ALPHABET
From MaRDI portal
Publication:3086242
DOI10.1142/S0129054111008076zbMath1222.68109MaRDI QIDQ3086242
Publication date: 30 March 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (16)
The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) ⋮ THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES ⋮ The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case ⋮ Kleene closure and state complexity ⋮ Magic Numbers in Periodic Sequences ⋮ On a structural property in the state complexity of projected regular languages ⋮ THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES ⋮ State complexity of binary coded regular languages ⋮ Operational Accepting State Complexity: The Unary and Finite Case ⋮ The Complexity of Languages Resulting from the Concatenation Operation ⋮ Minimisation of automata ⋮ Descriptional complexity of regular languages ⋮ More on the descriptional complexity of products of finite automata ⋮ The Ranges of Accepting State Complexities of Languages Resulting from Some Operations ⋮ State complexity of binary coded regular languages ⋮ The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)
Cites Work
- Unnamed Item
- A lower bound technique for the size of nondeterministic finite automata
- Partial orders on words, minimal elements of regular languages, and state complexity
- Intersection and union of regular languages and state complexity
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- Magic numbers in the state hierarchy of finite automata
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
This page was built for publication: MAGIC NUMBERS AND TERNARY ALPHABET
