Iterated Deterministic Substitution

Peter R.J. Asveld; Joost Engelfriet

doi:10.1007/BF00264471

Iterated Deterministic Substitution

Peter R.J. Asveld, Joost Engelfriet

Research output: Contribution to journal › Article › Academic › peer-review

10 Citations (Scopus)

29 Downloads (Pure)

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
Pages (from-to)	285-302
Number of pages	18
Journal	Acta informatica
Volume	8
Issue number	3
DOIs	https://doi.org/10.1007/BF00264471
Publication status	Published - 1977

Keywords

MSC-68A30
HMI-SLT: Speech and Language Technology
Information systems
Operating systems
Data structure
Communication networks
Information theory

Access to Document

10.1007/BF00264471

Asveld1977iterated
open
Final published version, 1 MB

Fingerprint Dive into the research topics of 'Iterated Deterministic Substitution'. Together they form a unique fingerprint.

Cite this

@article{39929891725845ce801780b2cf6a38fb,

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 = "MSC-68A30, HMI-SLT: Speech and Language Technology, Information systems, Operating systems, Data structure, Communication networks, Information theory",

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

year = "1977",

doi = "10.1007/BF00264471",

language = "English",

volume = "8",

pages = "285--302",

journal = "Acta informatica",

issn = "0001-5903",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - Iterated Deterministic Substitution

AU - Asveld, Peter R.J.

AU - Engelfriet, Joost

PY - 1977

Y1 - 1977

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 - MSC-68A30

KW - HMI-SLT: Speech and Language Technology

KW - Information systems

KW - Operating systems

KW - Data structure

KW - Communication networks

KW - Information theory

U2 - 10.1007/BF00264471

DO - 10.1007/BF00264471

M3 - Article

VL - 8

SP - 285

EP - 302

JO - Acta informatica

JF - Acta informatica

SN - 0001-5903

IS - 3

ER -