Kleene closure and state complexity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5595151 (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?)
- In search of most complex regular languages
- Kleene Closure on Regular and Prefix-Free Languages
- Magic numbers and ternary alphabet
- Magic numbers in the state hierarchy of finite automata
- On equations for regular languages, finite automata, and sequential networks
- Operational state complexity of prefix-free regular languages
- State complexity of union and intersection of star on \(k\) regular languages
- The ranges of state complexities for complement, star, and reversal of 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
Cited in
(6)- Kleene star on unary regular languages
- Functional Kleene Closures
- Closure properties of languages recognized by strictly k-edge finite state automata
- Operations on Permutation Automata
- Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
- Operations on Boolean and Alternating Finite Automata
This page was built for publication: Kleene closure and state complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956884)
