An Infinite Hierarchy of Context-Free Languages
From MaRDI portal
Publication:5573387
DOI10.1145/321495.321503zbMATH Open0182.02002OpenAlexW2092008211MaRDI QIDQ5573387FDOQ5573387
Authors: Sheila A. Greibach 
Publication date: 1969
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321495.321503
Cited In (52)
- Associative language descriptions
- Compelled operations and operations of degreeP
- On languages with a certain prefix property
- Indexed counter languages
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
- Regulated nondeterminism in pushdown automata
- Undecidability in matrices over Laurent polynomials.
- Theory of formal grammars
- On AFL generators for finitely encoded AFA
- On the universe, disjointness, and containment problems for simple machines
- On pebble automata
- Reversal-bounded multipushdown machines
- Title not available (Why is that?)
- Substitution and bounded languages
- Quasi-realtime languages
- Regular Realizability Problems and Context-Free Languages
- On some decision questions concerning pushdown machines
- Chains of full AFL's
- Syntactic operators on full semiAFLs
- Every iterated morphism yields a co-CFL
- Control sets on context-free grammar forms
- One way finite visit automata
- On regular realizability problems for context-free languages
- Strict deterministic grammars
- Uniformly erasable AFL
- Familles de langages fermées par crochet ouvert
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Linear weighted tree automata with storage and inverse linear tree homomorphisms
- Petri nets and regular languages
- On reducing the number of stack symbols in a PDA
- HYBRID EXTENDED FINITE AUTOMATA
- Comparing language operations
- Hierarchies of one-way multihead automata languages
- Finite turns and the regular closure of linear context-free languages
- Properties of right one-way jumping finite automata
- The complexity of decision problems for finite-turn multicounter machines
- Principal AFL
- Title not available (Why is that?)
- Restricted one-counter machines with undecidable universe problems
- Title not available (Why is that?)
- Some uniformly erasable families of languages
- Queue Automata: Foundations and Developments
- Title not available (Why is that?)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
- Characterizations of transductions defined by abstract families of transducers
- On equivalence and subclass containment problems for deterministic context-free languages
- Formal grammars for turn-bounded deterministic context-free languages
- One counter languages and the IRS condition
- Langages à un compteur
- Abstract families of relations
- Title not available (Why is that?)
- Two iteration theorems for some families of languages
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)
