Iterating iterated substitution
type: Item
instance of: scholarly article
title: Iterating iterated substitution
zbMATH Open document ID: 0364.68070
DOI: 10.1016/0304-3975(77)90043-3
author: Joost Engelfriet
published in: Theoretical Computer Science
publication date: 1978-01-01T00:00:00Z
full work available at URL: iterating-iterated-substitution(99ff8229-cf1e-4ff0-a286-97f47e267ea5).html
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3568044
MaRDI profile type: Publication
OpenAlex ID: W1978004465
cites work: Complexity theory and the operational structure of algebraic programming systems
cites work: Q4051626
cites work: The equality of EOL languages and codings of ol languages
cites work: A relationship between ETOL and EDTOL languages
cites work: Copying theorems
cites work: Substitution in families of languages
cites work: Full AFLs and nested iterated substitution
cites work: A generalization of Parikh's semilinear theorem
cites work: A characterization of context-free languages
cites work: Closure properties of some families of languages associated with biological systems
cites work: Description of developmental languages using recurrence systems
cites work: Q5592246
cites work: A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free
cites work: Q4116297
cites work: Substitution expressions
cites work: Nonterminals, homomorphisms and codings in different variations of OL- systems. II: Nondeterministic systems
cites work: TOL systems and languages
cites work: Extension of tabled 0L-systems and languages
cites work: Q4050175
cites work: On slicing of K-iteration grammars
cites work: On 0L-Languages
cites work: L systems
cites work: Q5678435
cites work: Decomposition Theorems for Various Kinds of Languages Parallel in Nature
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
cites work: Q4051631
cites work: A decomposition theorem for hyper-algebraic extensions of language families
cites work: A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
cites work: Cap expressions for context-free languages
description: scientific article; zbMATH DE number 3568044