State complexity of combined operations
From MaRDI portal
Publication:2383591
Recommendations
- On the State Complexity of Combined Operations
- State complexity of combined operations with union, intersection, star and reversal
- State complexity of four combined operations composed of union, intersection, star and reversal
- State complexity of two combined operations: catenation-union and catenation-intersection
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
Cites work
- scientific article; zbMATH DE number 1156489 (Why is no real title available?)
- scientific article; zbMATH DE number 1948495 (Why is no real title available?)
- scientific article; zbMATH DE number 1962776 (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 1458676 (Why is no real title available?)
- scientific article; zbMATH DE number 1747444 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1916664 (Why is no real title available?)
- scientific article; zbMATH DE number 1418342 (Why is no real title available?)
- scientific article; zbMATH DE number 3307592 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Partial orders on words, minimal elements of regular languages, and state complexity
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- State complexity of regular languages
- State complexity of some operations on binary regular languages
- 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
(50)- State complexity of power
- State complexity of unique rational operations
- Combination of roots and Boolean operations: an application to state complexity
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
- State-complexity hierarchies of uniform languages of alphabet-size length
- Estimation of state complexity of combined operations
- Primitivity, uniform minimality, and state complexity of Boolean operations
- On the boundary of regular languages
- State complexity of pattern matching in regular languages
- Composition and orbits of language operations: finiteness and upper bounds
- Undecidability of state complexity
- State complexity of Kleene-star operations on trees
- State complexity of combined operations with union, intersection, star and reversal
- State complexity of two combined operations: catenation-star and catenation-reversal
- State complexity of regular tree languages for tree matching
- State complexity of catenation combined with union and intersection
- Undecidability of state complexities using mirror images
- State complexity of two combined operations: catenation-union and catenation-intersection
- State complexity of boundary of prefix-free regular languages
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- State complexity of cyclic shift
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- 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
- scientific article; zbMATH DE number 2182451 (Why is no real title available?)
- State complexity and approximation
- State complexity of catenation combined with star and reversal
- Algebraic and combinatorial tools for state complexity: application to the star-xor problem
- New tools for state complexity
- scientific article; zbMATH DE number 7301304 (Why is no real title available?)
- State complexity of four combined operations composed of union, intersection, star and reversal
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- State complexity of catenation combined with a Boolean operation: a unified approach
- Operational state complexity of subtree-free regular tree languages
- In search of most complex regular languages
- Operational State Complexity under Parikh Equivalence
- Star-complement-star on prefix-free languages
- On the State Complexity of Combined Operations
- State complexity of deletion and bipolar deletion
- The exact state complexity for the composition of root and reversal
- Operational state complexity revisited: the contribution of monsters and modifiers
- Operational complexity: NFA-to-DFA trade-off
- Operational complexity: NFA-to-DFA trade-off
- State complexity of union and intersection of square and reversal on \(k\) regular languages
- The boundary operation on some subclasses of convex regular languages
- State complexity of inversion operations
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- State complexity of basic language operations combined with reversal
This page was built for publication: State complexity of combined operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383591)
