Classes of languages generated by the Kleene star of a word

Autor: Laure Daviaud, Charles Paperman

Publikováno v: Information and Computation
Information and Computation, 2018, 262 (Part 1), pp.90-109. ⟨10.1016/j.ic.2018.07.002⟩
Information and Computation, Elsevier, 2018, 262 (Part 1), pp.90-109. ⟨10.1016/j.ic.2018.07.002⟩
MFCS (1)
Mathematical Foundations of Computer Science 2015 ISBN: 9783662480564

International audience; In this paper, we study the lattice and the Boolean algebra, possibly closed under quotient, generated by the languages of the form $u⁎$, where $u$ is a word. We provide effective equational characterisations of these classe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c897eba835298addde59e3521ddd8fd9
http://wrap.warwick.ac.uk/104953/8/WRAP-classes-languages-generated-Kleene-star-Daviaud-2018.pdf

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.