Controlled iteration grammars and full hyper-AFL's

DOI10.1016/S0019-9958(77)90308-4MaRDI QIDQ4138166zbMATH OpenFDO

Authors Peter R. J. Asveld

Publication date 1977

Published in Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(21)

• Solution sets for equations over free groups are EDT0L languages
• The OI-hierarchy is closed under control
• Abstract grammars based on transductions
• The complexity of solution sets to equations in hyperbolic groups
• Extended macro grammars and stack controlled machines
• scientific article; zbMATH DE number 7456062 (Why is no real title available?)
• Iterated stack automata and complexity classes
• Algebraic aspects of families of fuzzy languages
• Tree transducers, L systems, and two-way machines
• Applications of L systems to group theory
• A hierarchical pattern description in the syntactic approach to pattern recognition
• More than 1700 years of word equations
• The translation power of top-down tree-to-graph transducers
• MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
• Hierarchies of hyper-AFLs
• Three hierarchies of transducers
• Extended linear macro grammars, iteration grammars, and register programs
• EDT0L grammars with only one variable have tractable generating functions
• Equations in virtually abelian groups: Languages and growth
• scientific article; zbMATH DE number 7561603 (Why is no real title available?)
• 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)