Star-Complement-Star on Prefix-Free Languages

DOI10.1007/978-3-319-19225-3_20zbMath1356.68134OpenAlexW1071382490MaRDI QIDQ5500696

Juraj Šebej, Matúš Palmovský

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation ⋮ Non-regular Maximal Prefix-Free Subsets of Regular Languages ⋮ Kuratowski Algebras Generated by Prefix-Free Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The state complexities of some basic operations on regular languages
• State complexity of combined operations
• State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
• CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM
• The State Complexity of Star-Complement-Star
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Cyclic Shift on Prefix-Free Languages

This page was built for publication: Star-Complement-Star on Prefix-Free Languages