State complexity of combined operations with two basic operations
From MaRDI portal
Recommendations
- 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 combined operations
- State complexity of union and intersection of star on \(k\) regular languages
- State complexity of basic language operations combined with reversal
Cites work
- 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 1517989 (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 3353192 (Why is no real title available?)
- Determination of finite automata accepting subregular languages
- Estimation of state complexity of combined operations
- On the State Complexity of Combined Operations
- On the state complexity of star of union and star of intersection
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- State complexity of basic language operations combined with reversal
- State complexity of combined operations
- State complexity of power
- State complexity of regular languages
- State complexity of some operations on binary regular languages
- State complexity of two combined operations: catenation-star and catenation-reversal
- State complexity of two combined operations: catenation-union and catenation-intersection
- State complexity research and approximation
- The state complexities of some basic operations on regular languages
- The state complexity of two combined operations: star of catenation and star of reversal
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Undecidability of the state complexity of composed regular operations
Cited in
(15)- A survey on operational state complexity
- State complexity of basic language operations combined with reversal
- State complexity of star of union and square of union on \textit{k} regular languages
- Undecidability of state complexity
- Descriptional complexity of finite automata -- selected highlights
- State complexity of four combined operations composed of union, intersection, star and reversal
- State complexity of combined operations with union, intersection, star and reversal
- Unrestricted state complexity of binary operations on regular languages
- Goodby to the kindhearted dragon Prof. Sheng Yu, 1950--2012
- State complexity of deletion and bipolar deletion
- State complexity of permutation on finite languages over a binary alphabet
- Combination of roots and Boolean operations: an application to state complexity
- State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
- In search of most complex regular languages
- Some properties of iterated languages
This page was built for publication: State complexity of combined operations with two basic operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q441851)
