Non-regular Maximal Prefix-Free Subsets of Regular Languages

DOI10.1007/978-3-662-53132-7_19zbMath1436.68175OpenAlexW2487112817MaRDI QIDQ2817391

Jozef jun. Jirásek

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• On universal computably enumerable prefix codes
• State Complexity of Combined Operations for Prefix-Free Regular Languages
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Cyclic Shift on Prefix-Free Languages
• Prefix-Free Subsets of Regular Languages and Descriptional Complexity
• Star-Complement-Star on Prefix-Free Languages

This page was built for publication: Non-regular Maximal Prefix-Free Subsets of Regular Languages