Kleene closure and state complexity
From MaRDI portal
Publication:2956884
DOI10.1051/ita/2016024zbMath1357.68107OpenAlexW2551879716MaRDI QIDQ2956884
Publication date: 19 January 2017
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2016024
Related Items (3)
Operations on Permutation Automata ⋮ Operations on Boolean and Alternating Finite Automata ⋮ Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- State complexity of union and intersection of star on \(k\) regular languages
- On equations for regular languages, finite automata, and sequential networks
- 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
- Magic numbers in the state hierarchy of finite automata
- MAGIC NUMBERS AND TERNARY ALPHABET
- Kleene Closure on Regular and Prefix-Free Languages
- THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES
- IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
This page was built for publication: Kleene closure and state complexity
