Abstract
We study Kuratowski algebras generated by prefix-free languages under the operations of star and complement. Our results are as follows. Five of 12 possible algebras cannot be generated by any prefixfree language. Two algebras are generated only by trivial prefix-free languages, the empty set and the language {ε}. Each of the remaining five algebras can be generated, for every n ≥ 4, by a regular prefix-free language of state complexity n, which meets the upper bounds on the state complexities of all the languages in the resulting algebra.
Cite
CITATION STYLE
Jirásek, J., & Š Ebej, J. (2016). Kuratowski algebras generated by prefix-free languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9705, pp. 150–162). Springer Verlag. https://doi.org/10.1007/978-3-319-40946-7_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
