Article ID Journal Published Year Pages File Type
11021119 Information and Computation 2018 20 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Classes of languages generated by the Kleene star of a word
Authors
, ,