Concatenation of Regular Languages and Descriptional Complexity
From MaRDI portal
Recommendations
- Concatenation of regular languages and descriptional complexity
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Implementation and Application of Automata
- Descriptional complexity of regular languages
- State complexity of the concatenation of regular tree languages
- The complexity of concatenation on deterministic and alternating finite automata
- Descriptional complexity of bounded regular languages
- Descriptional complexity of bounded regular languages
- The complexity of languages resulting from the concatenation operation
- The Complexity of Languages Resulting from the Concatenation Operation
Cites work
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- A lower bound technique for the size of nondeterministic finite automata
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 2068872 (Why is no real title available?)
- scientific article; zbMATH DE number 2081044 (Why is no real title available?)
- scientific article; zbMATH DE number 2182451 (Why is no real title available?)
- scientific article; zbMATH DE number 1834665 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Intersection and union of regular languages and state complexity
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
- Magic numbers in the state hierarchy of finite automata
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Nonterminal complexity of some operations on context-free languages
- On the State Complexity of Operations on Two-Way Finite Automata
- On the state complexity of reversals of regular languages
- Partial orders on words, minimal elements of regular languages, and state complexity
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- State complexity of some operations on binary regular languages
- Succinct representation of regular languages by Boolean automata
- The state complexities of some basic operations on regular languages
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(17)- On interpretability in the theory of concatenation
- Operational complexity and right linear grammars
- The Complexity of Languages Resulting from the Concatenation Operation
- State complexity of insertion
- scientific article; zbMATH DE number 1773089 (Why is no real title available?)
- The complexity of languages resulting from the concatenation operation
- Orthogonal concatenation: language equations and state complexity
- scientific article; zbMATH DE number 3894493 (Why is no real title available?)
- The complexity of concatenation on deterministic and alternating finite automata
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Implementation and Application of Automata
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Universal disjunctive concatenation and star
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Further Remarks on the Operational Nonterminal Complexity
- Concatenation of regular languages and descriptional complexity
- Concatenation operations and restricted variants of two-dimensional automata
This page was built for publication: Concatenation of Regular Languages and Descriptional Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392955)
