Iterated Deterministic Substitution

Peter R.J. Asveld; Joost Engelfriet

Iterated Deterministic Substitution

Peter R.J. Asveld, Joost Engelfriet

Research output: Book/Report › Report › Other research output

Abstract

Deterministic substitution of languages means substituting the same word (from a given language) for all occurrences of a symbol. For an arbitrary family $K$ of languages the notion of deterministic $K$-iteration grammar is introduced, which is essentially the iteration of a finite number of deterministic substitutions of languages from $K$. The families of languages generated by these grammars are investigated.

Original language	English
Place of Publication	Enschede
Publisher	University of Twente
Number of pages	27
Publication status	Published - 1976

Keywords

HMI-SLT: Speech and Language Technology

Cite this

@book{e80cdabab98a4217941860e0ffde2f46,

title = "Iterated Deterministic Substitution",

abstract = "Deterministic substitution of languages means substituting the same word (from a given language) for all occurrences of a symbol. For an arbitrary family $K$ of languages the notion of deterministic $K$-iteration grammar is introduced, which is essentially the iteration of a finite number of deterministic substitutions of languages from $K$. The families of languages generated by these grammars are investigated.",

keywords = "HMI-SLT: Speech and Language Technology",

author = "Asveld, {Peter R.J.} and Joost Engelfriet",

note = "The first author has been supported by Netherlands Organization for the Advancement of Pure Research (ZWO).",

year = "1976",

language = "English",

publisher = "University of Twente",

address = "Netherlands",

}

TY - BOOK

T1 - Iterated Deterministic Substitution

AU - Asveld, Peter R.J.

AU - Engelfriet, Joost

N1 - The first author has been supported by Netherlands Organization for the Advancement of Pure Research (ZWO).

PY - 1976

Y1 - 1976

N2 - Deterministic substitution of languages means substituting the same word (from a given language) for all occurrences of a symbol. For an arbitrary family $K$ of languages the notion of deterministic $K$-iteration grammar is introduced, which is essentially the iteration of a finite number of deterministic substitutions of languages from $K$. The families of languages generated by these grammars are investigated.

AB - Deterministic substitution of languages means substituting the same word (from a given language) for all occurrences of a symbol. For an arbitrary family $K$ of languages the notion of deterministic $K$-iteration grammar is introduced, which is essentially the iteration of a finite number of deterministic substitutions of languages from $K$. The families of languages generated by these grammars are investigated.

KW - HMI-SLT: Speech and Language Technology

M3 - Report

BT - Iterated Deterministic Substitution

PB - University of Twente

CY - Enschede

ER -

Iterated Deterministic Substitution

Abstract

Keywords

Fingerprint

Cite this