Abstract
We study maximal prefix-free subsets of regular languages and their descriptional complexity. We start with finite subsets and give the constructions of deterministic finite automata for largest and smallest finite maximal prefix-free subsets. Then we consider infinite maximal prefix-free subsets, and we show that such subsets can be effectively found if they exist. Finally, we prove that if a regular language has a non-regular maximal prefix-free subset, then it has uncountably many maximal prefix-free subsets.
Cite
CITATION STYLE
Jirásek, J. Š., & Šebej, J. (2015). Prefix-free subsets of regular languages and descriptional complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9118, pp. 129–140). Springer Verlag. https://doi.org/10.1007/978-3-319-19225-3_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
