Infinite Chains of Hyper-AFL's

P.R.J. Asveld, J. van Leeuwen

    Research output: Book/ReportReportOther research output

    Abstract

    A hyper-AFL is an abstract family of languages which is closed under iterated (parallel) substitution. In this paper we establish the existence of infinite chains of full hyper-AFL's strictly in between the context-free and context-sensitive languages. Several useful auxiliary results concerning derivation-controlled parallel rewriting systems are developwd in the proof.
    Original languageUndefined
    Place of PublicationEnschede
    PublisherUniversity of Twente, Department of Applied Mathematics
    Number of pages23
    Publication statusPublished - 1975

    Keywords

    • HMI-SLT: Speech and Language Technology
    • EWI-3670

    Cite this

    Asveld, P. R. J., & van Leeuwen, J. (1975). Infinite Chains of Hyper-AFL's. Enschede: University of Twente, Department of Applied Mathematics.