# An Infinite Sequence of Full AFL-structures, Each of Which Possesses an Infinite Hierarchy

Asveld, P.R.J.
(2001)
*An Infinite Sequence of Full AFL-structures, Each of Which Possesses an Infinite Hierarchy.*
In:
Where Mathematics, Computer Science, Liguistics and Biology Meet.
(Chapter 15), Kluwer, Dordrecht, The Netherlands, pp. 175-186.
ISBN 9780792366935

PDF
Restricted to UT campus only 136kB |

Abstract: | We investigate different sets of operations on languages which results in corresponding algebraic structures, viz.in different types of full AFL's (full Abstract Family of Languages). By iterating control on ETOL-systems we show that there exists an infinite sequence () of classes of such algebraic structures (full AFL-structures): each class is a proper superset of the next class (). In turn each class contains a countably infinite hierarchy, i.e., a countably infinite chain of language families () such that (i) each is closed under the operations that determine , and (ii) each is properly included in the next one: . |

Item Type: | Book Section |

Additional information: | Imported from HMI |

Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |

Link to this item: | http://purl.utwente.nl/publications/63355 |

Export this item as: | BibTeX EndNote HTML Citation Reference Manager |

Repository Staff Only: item control page