Journal Article10.1007/BF00264471
Iterated deterministic substitution
15
TL;DR: 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.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Languages with Homomorphic Replacements
Jürgen Albert,Lutz Wegner +1 more
- 14 Jul 1980
TL;DR: This work introduces H-systems as language generators using the concept of homomorphic replacement of variables by words from metalanguages, a generalization of the hypernotion construct in van Wijngaarden grammars with a number of hard open problems.
14
Context-Free Controlled ETOL Systems
Klaus-Jörn Lange
- 18 Jul 1983
TL;DR: The following results concerning context-free controlled ETOL systems are shown: (CF)ETOL=(D2)ETol=(DCF)ET OL Â (RMOL)EDTOL ⊂LOG(CF) EOL ⪵ (CF).
13
Languages with homomorphic replacements
Jürgen Albert,Lutz Wegner +1 more
TL;DR: This work introduces H-systems as language generators using the concept of homomorphic replacement of variables by words from metalanguages, a generalization of the hypernotion construct in van Wijngaarden grammars with a number of hard open problems.
12
Extended linear macro grammars, iteration grammars, and register programs
TL;DR: It is shown that extended macro Grammars have the same language generating power as (parallel) iteration grammars and can be formulated using iterated substitution using IO and OI versions.
12
Space-Bounded Complexity Classes and Iterated Deterministic Substitution
TL;DR: In this paper, the effect of deterministic substitution on space complexity was investigated when a language family is extended by means of a deterministic substitutation to the language family of the same language family.
10
References
•Book
Developmental systems and languages
Aristid Lindenmayer,Grzegorz Rozenberg +1 more
- 01 Jan 1975
TL;DR: Developmental systems were introduced in order to model morphogenetic (pattern-generating) processes in growing, multicellular, filamentous organisms by considering the states and outputs to be identical and thus omitting the output functions.
477
IO and OI
Joost Engelfriet,Erik Meineche Schmidt +1 more
- 01 Jul 1975
TL;DR: Several ''Mezei and Wright like'' results are obtained which relate to context-free tree languages, to recognizable tree languages and to nondeterministic recursive program(scheme)s (called by value and called by name).
Top-down tree transducers with regular look-ahead
Joost Engelfriet
- 01 Jul 1975
TL;DR: Top-down tree transducers with regular look-ahead are introduced and it is shown how these can be decomposed and composed, and how this leads to closure properties of surface sets and tree transformation languages.
Controlled Iteration Grammars and Full Hyper-AFL's (revised and extended version).
Peter R.J. Asveld
- 01 Jan 1976
TL;DR: The authors investigated derivation-controlled $K$-iteration grammars and showed that regular control does not increase the generating power of the derivation, and that the family of $(\Gamma,K)$ -iteration languages is a full hyper-AFL.
48
Related Papers (5)
[...]
Arto Salomaa
- 01 Aug 1973
Arto Salomaa
- 01 Oct 1973
P.R.J. Asveld,J. van Leeuwen +1 more
- 01 Jan 1975