Prefix-Free Subsets of Regular Languages and Descriptional Complexity

DOI10.1007/978-3-319-19225-3_11zbMath1432.68227OpenAlexW984527420MaRDI QIDQ5500687

Jozef Štefan Jirásek, Juraj Šebej

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_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Non-regular Maximal Prefix-Free Subsets of Regular Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Prefix-Free Languages: Right Quotient and Reversal

This page was built for publication: Prefix-Free Subsets of Regular Languages and Descriptional Complexity