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
133Kb

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 ${\cal C}_m$ ( $m\geq1$ ) of classes of such algebraic structures (full AFL-structures): each class is a proper superset of the next class ( ${\cal C}_m\supset{\cal C}_{m+1}$ ). In turn each class ${\cal C}_m$ contains a countably infinite hierarchy, i.e., a countably infinite chain of language families $K_{m,n}$ ( $n\geq1$ ) such that (i) each $K_{m,n}$ is closed under the operations that determine ${\cal C}_m$ , and (ii) each $K_{m,n}$ is properly included in the next one: $K_{m,n}\subset K_{m,n+1}$ .
Item Type:	Book Section
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

Show download statistics for this publication

Repository Staff Only: item control page