Chains of full AFL's
From MaRDI portal
Publication:5603191
DOI10.1007/BF01691106zbMath0203.30102OpenAlexW2076423537MaRDI QIDQ5603191
Publication date: 1970
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01691106
Related Items
Sur la structure des langages algébriques, Unnamed Item, On the usefulness of bifaithful rational cones, Unnamed Item, Familles de langages fermées par crochet ouvert, Unnamed Item, Unnamed Item, MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS, A model for ergodic automorphisms on groups, Langages sur des alphabets infinis, Unnamed Item, Langages algébriques déterministes non générateurs, A propos du lemme de substitution, Independance forte de certaines opérations, Unnamed Item, Formes de langages et de grammaires, Substitution of semi-AFL's, Langages satures et cônes decroissants. Langages et cônes bifideles, Unnamed Item, On incomparable abstract family of languages (AFL), Sur une conjecture de S. Greibach, Some independent families of one-letter languages, One counter languages and the IRS condition, Familles de langages translatables et fermées par crochet, Continuous operations on languages, Uniformly erasable AFL, 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, Bounded AFLs, Comparing language operations, One way finite visit automata, Opérations de cylindre et applications séquentielles gauches inverses, Générateurs algébriques et systèmes de paires iterantes, Compelled operations and operations of degreeP, Syntactic operators on full semiAFLs, A remark about a substitution property, Substitution and bounded languages, Context free normal systems and ETOL systems, Theory of formal grammars, Three hierarchies of transducers, Hierarchies of hyper-AFLs, Semi-linearity, Parikh-boundedness and tree adjunct languages, Extended macro grammars and stack controlled machines
Cites Work
- Checking automata and one-way stack languages
- Derivation-bounded languages
- Substitution in families of languages
- An Approach to a Unified Theory of Automata
- Indexed Grammars—An Extension of Context-Free Grammars
- An Infinite Hierarchy of Context-Free Languages
- Full AFLs and nested iterated substitution
- Studies in abstract families of languages
- Inclusion relations among families of context-free languages