Abstract
Each set of operations selected from union, intersection, complement, star, quotients, derivatives, word-reversal, and homomorphisms is investigated with respect to its closure of an arbitrary family of word-sets, as well as to its closure of an arbitrary family of regular languages. Certain sets are shown to produce a finite closure for every finite family of word-sets; others, to produce a finite closure only for every finite family of regular languages; in either case, the closure for a given family of regular languages can be calculated by algorithm. For a third class-of sets, the closure is not necessarily finite even for finite families of regular languages.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
