The structure of partially ordered monoids generated by certain operators on language families (of which each is induced by operations on languages) is investigated. In particular operators are considered that define prequasoids (i.e. language families closed under finite substitution and intersection with regular languages), full trios, full semi-AFL's, full pseudo-AFL's (i.e. full semi-AFL's closed under concatenation), full AFL's, full substitution-closed AFL's, full super-AFL's, and full hyper-AFL's. The structure of these monoids provides better insight in the (in)deoendency of closure properties relevant in AFL-theory.
|Place of Publication||Enschede|
|Publisher||University of Twente, Department of Applied Mathematics|
|Number of pages||23|
|Publication status||Published - 1978|
- HMI-SLT: Speech and Language Technology