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