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.
Asveld, P.R.J. ; van Leeuwen, J. / Infinite Chains of Hyper-AFL's. Enschede : University of Twente, Department of Applied Mathematics, 1975. 23 p.
@book{6d2b2e6b254d4812a4ff73e212e454e8,
title = "Infinite Chains of Hyper-AFL's",
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.",
keywords = "HMI-SLT: Speech and Language Technology, EWI-3670",
author = "P.R.J. Asveld and {van Leeuwen}, J.",
note = "Research partly supported by Netherlands Organization for the Advancement of Pure Research (ZWO).",
year = "1975",
language = "Undefined",
publisher = "University of Twente, Department of Applied Mathematics",

}

Asveld, PRJ & van Leeuwen, J 1975, Infinite Chains of Hyper-AFL's. University of Twente, Department of Applied Mathematics, Enschede.

Infinite Chains of Hyper-AFL's. / Asveld, P.R.J.; van Leeuwen, J.

Enschede : University of Twente, Department of Applied Mathematics, 1975. 23 p.

Research output: Book/ReportReportOther research output

TY - BOOK

T1 - Infinite Chains of Hyper-AFL's

AU - Asveld, P.R.J.

AU - van Leeuwen, J.

N1 - Research partly supported by Netherlands Organization for the Advancement of Pure Research (ZWO).

PY - 1975

Y1 - 1975

N2 - 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.

AB - 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.

KW - HMI-SLT: Speech and Language Technology

KW - EWI-3670

M3 - Report

BT - Infinite Chains of Hyper-AFL's

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -

Asveld PRJ, van Leeuwen J. Infinite Chains of Hyper-AFL's. Enschede: University of Twente, Department of Applied Mathematics, 1975. 23 p.