Classes of languages generated by the Kleene star of a word

Laure Daviaud, Charles Paperman

Research output: Contribution to journalArticlepeer-review


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 classes, i.e. one can decide using our descriptions whether a given regular language belongs or not to each of them.

Original languageEnglish
Pages (from-to)90-109
Number of pages20
JournalInformation and Computation
Early online date26 Sep 2018
Publication statusPublished - Oct 2018


  • Automata theory
  • Decidability
  • Kleene star
  • Profinite equations
  • Regular languages

Cite this