An Infinite Hierarchy of Context-Free Languages
From MaRDI portal
Publication:5573387
DOI10.1145/321495.321503zbMath0182.02002MaRDI QIDQ5573387
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
Related Items
Quasi-realtime languages, Chains of full AFL's, Characterizations of transductions defined by abstract families of transducers, Abstract families of relations, Associative language descriptions, On some decision questions concerning pushdown machines, Familles de langages fermées par crochet ouvert, Undecidability in matrices over Laurent polynomials., Syntactic operators on full semiAFLs, 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, 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, HYBRID EXTENDED FINITE AUTOMATA, Unnamed Item, Restricted one-counter machines with undecidable universe problems, Compelled operations and operations of degreeP, Unnamed Item, Unnamed Item, Indexed counter languages, Unnamed Item, Unnamed Item, On languages with a certain prefix property, Comparing language operations
