Publication:3953199
From MaRDI portal
zbMath0491.68076MaRDI QIDQ3953199
Publication date: 1981
generative system; characterizations of language families in terms of g- systems; complexity measures of g-systems and of generated languages
68Q45: Formal languages and automata
Related Items
Parsimonious computational completeness, Iterated sequential transducers as language generating devices, A representation of recursively enumerable languages by two homomorphisms and a quotient, Abstract grammars based on transductions, Iterated relabeling tree transducers, A computation model with automatic functions and relations as primitive operations, Transductions and the parallel generation of languages†, Normal forms for phrase-structure grammars