The following pages link to Derivation-bounded languages (Q2533505):
Displaying 37 items.
- On the index of positive programmed formal languages (Q673473) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- Convergence of Newton's method over commutative semirings (Q899320) (← links)
- Substitution of semi-AFL's (Q1157913) (← links)
- Tree acceptors and grammar forms (Q1160494) (← links)
- Avoidance control mechanics for food-chain models subject to uncertainties (Q1200588) (← links)
- One counter languages and the IRS condition (Q1218284) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- Context-free grammar forms (Q1226865) (← links)
- Grammarforms and grammarhomomorphisms (Q1229098) (← links)
- Commutative grammars (Q1236889) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- One way finite visit automata (Q1242687) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Grammatical characterizations of NPDAs and VPDAs with counters (Q1784750) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Left-derivation bounded languages (Q1843308) (← links)
- Theory of formal grammars (Q1846334) (← links)
- On families of full trios containing counter machine languages (Q2333810) (← links)
- Finite turns and the regular closure of linear context-free languages (Q2384399) (← links)
- Substitution in families of languages (Q2544191) (← links)
- A characterization of context-free languages (Q2549240) (← links)
- On Grammars Controlled by Parikh Vectors (Q3166956) (← links)
- Management of food-chain systems via Liapunov design control (Q3360710) (← links)
- Newton’s Method for ω-Continuous Semirings (Q3520300) (← links)
- Inductive inference of context-free languages based on context-free expressions (Q3806846) (← links)
- (Q3873564) (← links)
- Compelled operations and operations of degreeP (Q3890132) (← links)
- Abstract families of context-free grammars (Q3902532) (← links)
- Sur la structure des langages algébriques (Q3967070) (← links)
- (Q4168079) (← links)
- Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables (Q4174258) (← links)
- Control sets on grammars using depth-first derivations (Q4198079) (← links)
- (Q4403742) (← links)
- Weightreducing grammars and ultralinear languages (Q4825386) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
- Chains of full AFL's (Q5603191) (← links)
