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