Kleene Closure on Regular and Prefix-Free Languages

DOI10.1007/978-3-319-08846-4_17zbMath1302.68166OpenAlexW1025661864MaRDI QIDQ3192267

Matúš Palmovský, Juraj Šebej, Galina Jirásková

Publication date: 26 September 2014

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08846-4_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Kleene closure and state complexity ⋮ Power, positive closure, and quotients on convex languages ⋮ Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation ⋮ Complexity of bifix-free regular languages ⋮ Complexity of bifix-free regular languages ⋮ The Complexity of Languages Resulting from the Concatenation Operation ⋮ Kuratowski Algebras Generated by Prefix-Free Languages ⋮ The Ranges of Accepting State Complexities of Languages Resulting from Some Operations ⋮ A pumping lemma for regular closure of prefix-free languages

Uses Software

• JFLAP