Abstract

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.

Publication Type:	Article
Additional Information:	© 2018 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Publisher Keywords:	Automata theory, Regular languages, Profinite equations, Kleene star, Decidability
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments:	School of Science & Technology > Computer Science

Preview

Text - Accepted Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (460kB) | Preview

Export

Downloads