An Infinite Hierarchy of Context-Free Languages
From MaRDI portal
Cited in
(52)- Every iterated morphism yields a co-CFL
- On pebble automata
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
- Hierarchies of one-way multihead automata languages
- The complexity of decision problems for finite-turn multicounter machines
- Petri nets and regular languages
- Two iteration theorems for some families of languages
- One counter languages and the IRS condition
- Reversal-bounded multipushdown machines
- Uniformly erasable AFL
- Some uniformly erasable families of languages
- Control sets on context-free grammar forms
- One way finite visit automata
- On equivalence and subclass containment problems for deterministic context-free languages
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
- Langages à un compteur
- Theory of formal grammars
- Linear weighted tree automata with storage and inverse linear tree homomorphisms
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Finite turns and the regular closure of linear context-free languages
- Principal AFL
- Substitution and bounded languages
- On AFL generators for finitely encoded AFA
- Strict deterministic grammars
- On reducing the number of stack symbols in a PDA
- On regular realizability problems for context-free languages
- HYBRID EXTENDED FINITE AUTOMATA
- Restricted one-counter machines with undecidable universe problems
- Compelled operations and operations of degreeP
- scientific article; zbMATH DE number 3776895 (Why is no real title available?)
- Indexed counter languages
- scientific article; zbMATH DE number 3548457 (Why is no real title available?)
- scientific article; zbMATH DE number 3551931 (Why is no real title available?)
- On languages with a certain prefix property
- Comparing language operations
- scientific article; zbMATH DE number 3604381 (Why is no real title available?)
- scientific article; zbMATH DE number 3628412 (Why is no real title available?)
- Queue Automata: Foundations and Developments
- Regular Realizability Problems and Context-Free Languages
- Quasi-realtime languages
- Chains of full AFL's
- Characterizations of transductions defined by abstract families of transducers
- Properties of right one-way jumping finite automata
- Abstract families of relations
- On some decision questions concerning pushdown machines
- Associative language descriptions
- Familles de langages fermées par crochet ouvert
- Formal grammars for turn-bounded deterministic context-free languages
- Undecidability in matrices over Laurent polynomials.
- On the universe, disjointness, and containment problems for simple machines
- Syntactic operators on full semiAFLs
- Regulated nondeterminism in pushdown automata
This page was built for publication: An Infinite Hierarchy of Context-Free Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5573387)
