### Abstract

We investigate different sets of operations on languages which result 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 C

_{m}(m⩾1) of classes of such algebraic structures (full AFL-structures): each class is a proper superset of the next class (C_{m}⊃ C_{m +1}). In turn each class C_{m}contains a countably infinite hierarchy, i.e. a countably infinite chain of language families K_{m,n}(n⩾1) such that (i) each K_{m,n}is closed under the operations that determine C m and (ii) each K m,n is properly included in the next one: K_{m,n}⊂ K_{m,n+1}.Original language | English |
---|---|

Title of host publication | Where Mathematics, Computer Science, Liguistics and Biology Meet |

Subtitle of host publication | Essays in honour of Gheorghe Păun |

Editors | Carlos Martin-Vide, Victor Mitrana |

Place of Publication | Dordrecht, The Netherlands |

Publisher | Kluwer |

Pages | 175-186 |

Number of pages | 12 |

ISBN (Electronic) | 978-94-015-9634-3 |

ISBN (Print) | 978-90-481-5607-8 |

DOIs | |

Publication status | Published - 2001 |

## Fingerprint Dive into the research topics of 'An Infinite Sequence of Full AFL-structures, Each of Which Possesses an Infinite Hierarchy'. Together they form a unique fingerprint.

## Cite this

Asveld, P. R. J. (2001). An Infinite Sequence of Full AFL-structures, Each of Which Possesses an Infinite Hierarchy. In C. Martin-Vide, & V. Mitrana (Eds.),

*Where Mathematics, Computer Science, Liguistics and Biology Meet: Essays in honour of Gheorghe Păun*(pp. 175-186). Dordrecht, The Netherlands: Kluwer. https://doi.org/10.1007/978-94-015-9634-3_15