The following pages link to (Q3292904):
Displaying 50 items.
- Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes (Q256437) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Decidability of operation problems for T0L languages and subclasses (Q553300) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- Propositional dynamic logic of nonregular programs (Q792083) (← links)
- Bounded languages described by GF(2)-grammars (Q832949) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- The interchange or pump (di)lemmas for context-free languages (Q1104760) (← links)
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
- Comparisons of Parikh's condition to other conditions for context-free languages (Q1128989) (← links)
- One-way weak-stack-counter automata (Q1137874) (← links)
- Two iteration theorems for the LL(k) languages (Q1148695) (← links)
- Monadic Thue systems (Q1165842) (← links)
- A note on the sufficiency of Sokolowski's criterion for context-free languages (Q1169297) (← links)
- The Turing degree of the inherent ambiguity problem for context-free languages (Q1220391) (← links)
- On derivation trees of indexed grammars - an extension of the uvwxy- theorem (Q1222965) (← links)
- Intercalation lemmas for tree transducer languages (Q1237574) (← links)
- On LR(k) grammars and languages (Q1239009) (← links)
- A simplified proof of Parikh's theorem (Q1241068) (← links)
- \(\omega\)-computations on deterministic pushdown machines (Q1247962) (← links)
- Pumping lemmas for term languages (Q1250713) (← links)
- On equivalence of grammars through transformation trees (Q1259173) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- A new algorithm for regularizing one-letter context-free grammars. (Q1426442) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- On the complexity of automatic complexity (Q1694011) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- Ambiguity and decision problems for local adjunct languages (Q1843306) (← links)
- Boolean grammars (Q1886037) (← links)
- The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Rational index of languages with bounded dimension of parse trees (Q2164007) (← links)
- Beyond operator-precedence grammars and languages (Q2186819) (← links)
- Effective categoricity of automatic equivalence and nested equivalence structures (Q2195573) (← links)
- Structure des grammaires d'ambiguite bornee (Q2264417) (← links)
- The unsolvability of the equality problem for sentential forms of context-free grammars (Q2264550) (← links)
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet (Q2280321) (← links)
- Ogden's lemma, multiple context-free grammars, and the control language hierarchy (Q2280330) (← links)
- Some applications of the formalization of the pumping lemma for context-free languages (Q2333674) (← links)
- Bracketed context-free languages (Q2525996) (← links)
- Reduktionssätze über eine Klasse formaler Sprachen mit endlich vielen Zuständen (Q2527229) (← links)
- Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen (Q2531283) (← links)
- Derivation-bounded languages (Q2533505) (← links)
- Generalized sequential machine maps (Q2540272) (← links)
- Probabilistic tree automata and context free languages (Q2542994) (← links)
- Substitution in families of languages (Q2544191) (← links)
