Chains of full AFL's

DOI10.1007/BF01691106zbMATH Open0203.30102OpenAlexW2076423537MaRDI QIDQ5603191FDOQ5603191

Authors: Sheila A. Greibach 

Publication date: 1970

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01691106

Cites Work

• Indexed Grammars—An Extension of Context-Free Grammars
• An Infinite Hierarchy of Context-Free Languages
• Full AFLs and nested iterated substitution
• An Approach to a Unified Theory of Automata
• Checking automata and one-way stack languages
• Studies in abstract families of languages
• Derivation-bounded languages
• Substitution in families of languages
• Inclusion relations among families of context-free languages

Cited In (42)

• Compelled operations and operations of degreeP
• A remark about a substitution property
• Langages sur des alphabets infinis
• Some independent families of one-letter languages
• Générateurs algébriques et systèmes de paires iterantes
• Theory of formal grammars
• Title not available (Why is that?)
• Substitution and bounded languages
• Bounded AFLs
• Sur la structure des langages algébriques
• Syntactic operators on full semiAFLs
• Extended macro grammars and stack controlled machines
• Formes de langages et de grammaires
• A propos du lemme de substitution
• Substitution of semi-AFL's
• On the usefulness of bifaithful rational cones
• On incomparable abstract family of languages (AFL)
• One way finite visit automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Independance forte de certaines opérations
• The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper
• Uniformly erasable AFL
• Continuous operations on languages
• Opérations de cylindre et applications séquentielles gauches inverses
• Familles de langages translatables et fermées par crochet
• Familles de langages fermées par crochet ouvert
• Langages algébriques déterministes non générateurs
• Title not available (Why is that?)
• Langages satures et cônes decroissants. Langages et cônes bifideles
• Comparing language operations
• Title not available (Why is that?)
• MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
• Title not available (Why is that?)
• Three hierarchies of transducers
• Hierarchies of hyper-AFLs
• Semi-linearity, Parikh-boundedness and tree adjunct languages
• Title not available (Why is that?)
• Sur une conjecture de S. Greibach
• Context free normal systems and ETOL systems
• A model for ergodic automorphisms on groups
• One counter languages and the IRS condition

This page was built for publication: Chains of full AFL's

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5603191)