Principal AFL
From MaRDI portal
Cites work
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- An Infinite Hierarchy of Context-Free Languages
- Checking automata and one-way stack languages
- Finite-Turn Pushdown Automata
- scientific article; zbMATH DE number 3363526 (Why is no real title available?)
- Nested Stack Automata
- On certain formal properties of grammars
- Studies in abstract families of languages
- Substitution in families of languages
Cited in
(56)- Reset machines
- Automates a file
- Independance forte de certaines opérations
- Left transformation languages
- Morphismes et bimorphismes d'arbres
- On incomparable abstract family of languages (AFL)
- Two iteration theorems for some families of languages
- Two-way A-transducers and AFL
- Reversal-bounded multipushdown machines
- Familles de langages translatables et fermées par crochet
- Abstract families of length-preserving processors
- Uniformly erasable AFL
- Bounded AFLs
- Comparing complexity classes
- Characterization theorems on abstract families of transducers
- Proving containment of bounded AFL
- Some uniformly erasable families of languages
- Computation sequence sets
- Control sets on context-free grammar forms
- Un théorème de Chomsky-Schützenberger pour les forets algébriques
- One way finite visit automata
- On two-way sequential transductions of full semi-AFL's
- Opérations de cylindre et applications séquentielles gauches inverses
- Remarks on blind and partially blind one-way multicounter machines
- Générateurs algébriques et systèmes de paires iterantes
- Refining the hierarchy of blind multicounter languages and twist-closed trios.
- Theory of formal grammars
- Principal abstract families of weighted tree languages
- Weighted automata with storage
- On the existence of generators for certain AFL
- Three theorems concerning principal AFLs
- Substitution and bounded languages
- AFL with the semilinear property
- Writing stack acceptors
- On AFL generators for finitely encoded AFA
- The emptiness problem for valence automata over graph monoids
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Single-tape reset machines
- Abstract families of context-free grammars
- On some families of languages related to developmental systems
- scientific article; zbMATH DE number 3461494 (Why is no real title available?)
- scientific article; zbMATH DE number 3551930 (Why is no real title available?)
- scientific article; zbMATH DE number 3602690 (Why is no real title available?)
- scientific article; zbMATH DE number 3602691 (Why is no real title available?)
- scientific article; zbMATH DE number 3604381 (Why is no real title available?)
- scientific article; zbMATH DE number 3628412 (Why is no real title available?)
- scientific article; zbMATH DE number 3630239 (Why is no real title available?)
- Context free closed families of languages
- Multi-stack-counter languages
- A model for ergodic automorphisms on groups
- Abstract families of relations
- Familles de langages fermées par crochet ouvert
- MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
- Rational weighted tree languages with storage
- The n-ary initial literal and literal shuffle
- Syntactic operators on full semiAFLs
This page was built for publication: Principal AFL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2540269)
