Most complex non-returning regular languages
From MaRDI portal
Publication:5205037
Recommendations
Cites work
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 6855103 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A new technique for reachability of states in concatenation automata
- Complexity of atoms of regular languages
- Complexity of atoms, combinatorially
- Complexity of left-ideal, suffix-closed and suffix-free regular languages
- Complexity of right-ideal, prefix-closed, and prefix-free regular languages
- Complexity of suffix-free regular languages
- Implementation and Application of Automata
- In search of most complex regular languages
- Most complex regular ideal languages
- On deterministic finite automata and syntactic monoid size
- On the State Complexity of the Shuffle of Regular Languages
- Quotient complexities of atoms in regular ideal languages
- Reversal of binary regular languages
- State complexity of basic operations on non-returning regular languages
- Symmetric groups and quotient complexity of Boolean operations
- Syntactic complexity of regular ideals
- The state complexities of some basic operations on regular languages
- Theory of átomata
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Unrestricted state complexity of binary operations on regular languages
Cited in
(5)
This page was built for publication: Most complex non-returning regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205037)
