STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
From MaRDI portal
Recommendations
- Implementation and Application of Automata
- Concatenation of regular languages and descriptional complexity
- Concatenation of Regular Languages and Descriptional Complexity
- State complexity of some operations on binary regular languages
- The state complexities of some basic operations on regular languages
Cites work
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- A lower bound technique for the size of nondeterministic finite automata
- Communication complexity method for measuring nondeterminism in finite automata
- Finite automata and unary languages
- Intersection and union of regular languages and state complexity
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Partial orders on words, minimal elements of regular languages, and state complexity
- 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
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(50)- State complexity of star of union and square of union on \textit{k} regular languages
- State complexity of combined operations for suffix-free regular languages
- State complexity of union and intersection of star on \(k\) regular languages
- State complexity of combined operations with two basic operations
- Is complementation evil?
- State complexity of catenation combined with a Boolean operation: a unified approach
- The Complexity of Languages Resulting from the Concatenation Operation
- scientific article; zbMATH DE number 1773091 (Why is no real title available?)
- Combination of roots and Boolean operations: an application to state complexity
- The state complexity of star-complement-star
- State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
- Generalized de Bruijn words and the state complexity of conjugate sets
- State complexity of power
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- State complexity of union and intersection of square and reversal on \(k\) regular languages
- State complexity of some operations on binary regular languages
- State complexity of two combined operations: catenation-union and catenation-intersection
- Magic Numbers and Ternary Alphabet
- State complexity of deletion and bipolar deletion
- New tools for state complexity
- Operational state complexity revisited: the contribution of monsters and modifiers
- Estimation of state complexity of combined operations
- State complexity of boundary of prefix-free regular languages
- State complexity of combined operations
- Complementing two-way finite automata
- State complexity of four combined operations composed of union, intersection, star and reversal
- Operational state complexity of subtree-free regular tree languages
- State complexity of insertion
- State complexity of two combined operations: catenation-star and catenation-reversal
- The complexity of concatenation on deterministic and alternating finite automata
- Quantitatively nonblocking supervisory control of discrete-event systems
- Concatenation of Regular Languages and Descriptional Complexity
- Universal disjunctive concatenation and star
- scientific article; zbMATH DE number 7453083 (Why is no real title available?)
- Magic numbers and ternary alphabet
- Concatenation of regular languages and descriptional complexity
- The ranges of state complexities for complement, star, and reversal of regular languages
- A Study of a Simple Class of Modifiers: Product Modifiers
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
- Nondeterministic operational complexity in subregular languages
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- Descriptional complexity of regular languages
- State complexity of unambiguous operations on finite automata
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Undecidability of state complexity
- State complexity of catenation combined with union and intersection
- Bounded-time nonblocking supervisory control of timed discrete-event systems
- Complexity in union-free regular languages
This page was built for publication: STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5462121)
