CLOSURES WHICH PRESERVE FINITENESS IN FAMILIES OF LANGUAGES,
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 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. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1967
- Accession Number
- AD0666408
Entities
People
- Gene F. Rose
Organizations
- System Development Corporation