TY - GEN
T1 - Classes of Languages Generated by the Kleene Star of a Word
AU - Daviaud, Laure
AU - Paperman, Charles
N1 - Funding Information:
The second author is supported by WCMCS.
Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2015.
PY - 2015
Y1 - 2015
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84943619030
U2 - 10.1007/978-3-662-48057-1_13
DO - 10.1007/978-3-662-48057-1_13
M3 - Conference contribution
AN - SCOPUS:84943619030
SN - 978-3-662-48056-4
T3 - Lecture Notes in Computer Science
SP - 167
EP - 178
BT - MFCS 2015: Mathematical Foundations of Computer Science 2015
A2 - Italiano, Giuseppe F.
A2 - Pighizzini, Giovanni
A2 - Sannella, Donald T.
PB - Springer-Verlag Berlin Heidelberg
T2 - 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015
Y2 - 24 August 2015 through 28 August 2015
ER -