Derivation-bounded languages
From MaRDI portal
Publication:2533505
DOI10.1016/S0022-0000(68)80009-1zbMath0176.16703MaRDI QIDQ2533505
Seymour Ginsburg, Edwin H. Spanier
Publication date: 1968
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Sur la structure des langages algébriques ⋮ On Grammars Controlled by Parikh Vectors ⋮ Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ Unnamed Item ⋮ Finite turns and the regular closure of linear context-free languages ⋮ Chains of full AFL's ⋮ Weightreducing grammars and ultralinear languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Convergence of Newton's method over commutative semirings ⋮ Newton’s Method for ω-Continuous Semirings ⋮ Substitution of semi-AFL's ⋮ Tree acceptors and grammar forms ⋮ Inductive inference of context-free languages based on context-free expressions ⋮ On the index of positive programmed formal languages ⋮ Avoidance control mechanics for food-chain models subject to uncertainties ⋮ One counter languages and the IRS condition ⋮ Uniformly erasable AFL ⋮ Context-free grammar forms ⋮ Grammarforms and grammarhomomorphisms ⋮ Commutative grammars ⋮ Grammatical characterizations of NPDAs and VPDAs with counters ⋮ Control sets on context-free grammar forms ⋮ One way finite visit automata ⋮ Management of food-chain systems via Liapunov design control ⋮ A Greibach normal form for context-free graph grammars ⋮ Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables ⋮ Compelled operations and operations of degreeP ⋮ Abstract families of context-free grammars ⋮ Syntactic operators on full semiAFLs ⋮ Substitution in families of languages ⋮ Control sets on grammars using depth-first derivations ⋮ A characterization of context-free languages ⋮ Linear graph grammars: Power and complexity ⋮ Left-derivation bounded languages ⋮ On families of full trios containing counter machine languages ⋮ Theory of formal grammars
Cites Work
