Pages that link to "Item:Q5565120"
From MaRDI portal
The following pages link to A helpful result for proving inherent ambiguity (Q5565120):
Displayed 50 items.
- On context-free and Szilard languages (Q794440) (← links)
- On the growth of linear languages (Q817237) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Slender Siromoney matrix languages (Q948096) (← links)
- A pumping lemma for real-time deterministic context-free languages (Q1081309) (← links)
- The interchange or pump (di)lemmas for context-free languages (Q1104760) (← links)
- Comparisons of Parikh's condition to other conditions for context-free languages (Q1128989) (← links)
- Iteration theorems for families of strict deterministic languages (Q1143811) (← links)
- Langages sur des alphabets infinis (Q1144383) (← links)
- Two iteration theorems for the LL(k) languages (Q1148695) (← links)
- Independance forte de certaines opérations (Q1151759) (← links)
- Permutations are not context-free: An application of the interchange lemma (Q1165021) (← links)
- A pushdown automaton or a context-free grammar - which is more economical? (Q1165026) (← links)
- A note on the sufficiency of Sokolowski's criterion for context-free languages (Q1169297) (← links)
- On satisfying the LL-iteration theorem (Q1172400) (← links)
- Two iteration theorems for some families of languages (Q1214758) (← links)
- The Turing degree of the inherent ambiguity problem for context-free languages (Q1220391) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- Monoides syntactiques des langages algébriques (Q1225944) (← links)
- Tree adjunct grammars (Q1225947) (← links)
- The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper (Q1227278) (← links)
- A strong pumping lemma for context-free languages (Q1238637) (← links)
- A simplified proof of Parikh's theorem (Q1241068) (← links)
- Complexity metatheorems for context-free grammar problems (Q1246270) (← links)
- Langages algébriques, paires iterantes et transductions rationnelles (Q1247022) (← links)
- Générateurs algébriques et systèmes de paires iterantes (Q1258610) (← links)
- Algebraic languages and polyominoes enumeration (Q1348529) (← links)
- A complexity analysis of the elementary cellular automaton of rule 122 (Q1428842) (← links)
- On the size complexity of hybrid networks of evolutionary processors (Q1763710) (← links)
- Left-derivation bounded languages (Q1843308) (← links)
- Theory of formal grammars (Q1846334) (← links)
- On grammatical complexity of a class of attractors (Q1914592) (← links)
- Queues, stacks, and transcendentality at the transition to chaos (Q1961669) (← links)
- Sublogarithmic ambiguity (Q2575762) (← links)
- A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES (Q3401478) (← links)
- Growth and ergodicity of context-free languages II: The linear case (Q3420282) (← links)
- A note onxy languages (Q3680295) (← links)
- Ogden's lemma for nonterminal bounded languages (Q3768421) (← links)
- Coordinated pair systems ; part II : sparse structure of Dyck words and Ogden's lemma (Q3780467) (← links)
- (Q3859269) (← links)
- (Q3873564) (← links)
- (Q3899528) (← links)
- (Q3923599) (← links)
- Sur une propriété d'itération des langages algébriques déterministes (Q3925891) (← links)
- Sur la structure des langages algébriques (Q3967070) (← links)
- Le cylindre des langages linéaires (Q4122824) (← links)
- On languages with a certain prefix property (Q4131045) (← links)
- (Q4155840) (← links)
- (Q4168079) (← links)
- (Q4168085) (← links)