Controlled iteration grammars and full hyper-AFL's
From MaRDI portal
Publication:4138166
DOI10.1016/S0019-9958(77)90308-4zbMath0363.68099MaRDI QIDQ4138166
Publication date: 1977
Published in: Information and Control (Search for Journal in Brave)
Related Items
The complexity of solution sets to equations in hyperbolic groups, The translation power of top-down tree-to-graph transducers, Solution Sets for Equations over Free Groups are EDT0L Languages, The OI-hierarchy is closed under control, Equations in virtually abelian groups: Languages and growth, More Than 1700 Years of Word Equations, Tree transducers, L systems, and two-way machines, EDT0L grammars with only one variable have tractable generating functions, MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS, A hierarchical pattern description in the syntactic approach to pattern recognition, Unnamed Item, Abstract grammars based on transductions, Solutions to twisted word equations and equations in virtually free groups, Applications of L systems to group theory, Iterated stack automata and complexity classes, Unnamed Item, Extended linear macro grammars, iteration grammars, and register programs, Three hierarchies of transducers, Hierarchies of hyper-AFLs, Extended macro grammars and stack controlled machines, Algebraic aspects of families of fuzzy languages
