Pages that link to "Item:Q5609393"
From MaRDI portal
The following pages link to Properties of deterministic top-down grammars (Q5609393):
Displayed 50 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Polynomial time learning of simple deterministic languages via queries and a representative sample (Q706625) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Lower bounds on the size of deterministic parsers (Q792100) (← links)
- On the complexity of LL(k) testing (Q794445) (← links)
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- Reversible top-down syntax analysis (Q832945) (← links)
- The hardest \(\operatorname{LL}(k)\) language (Q832952) (← links)
- Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- The interchange or pump (di)lemmas for context-free languages (Q1104760) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- A method for transforming grammars into LL(k) form (Q1134533) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- Iteration theorems for families of strict deterministic languages (Q1143811) (← links)
- Two iteration theorems for the LL(k) languages (Q1148695) (← links)
- A parsing automata approach to LR theory (Q1157181) (← links)
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)
- The equivalence problem for LL- and LR-regular grammars (Q1162821) (← links)
- A hierarchy of real-time deterministic languages and their equivalence (Q1165588) (← links)
- On LLP(k) grammars and languages (Q1166936) (← links)
- On the relationship between the LL(k) and LR(k) grammars (Q1167546) (← links)
- Deterministic one-counter automata (Q1218272) (← links)
- Attributed translations (Q1218732) (← links)
- LL(1) grammars supporting an efficient error handling (Q1218733) (← links)
- LL-regular grammars (Q1220793) (← links)
- Program equivalence and context-free grammars (Q1221492) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- A result on the equivalence problem for deterministic pushdown automata (Q1230509) (← links)
- The inclusion problem for simple languages (Q1235014) (← links)
- Normal forms of deterministic grammars (Q1238425) (← links)
- A direct algorithm for checking equivalence of LL(k) grammars (Q1238431) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
- Two decidability results for deterministic pushdown automata (Q1254241) (← links)
- On equivalence of grammars through transformation trees (Q1259173) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- Fast deterministic parsers for transition networks (Q1789065) (← links)
- Decidability of the equivalence problem for deterministic pushdown automata (Q1816326) (← links)
- Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
- A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages (Q1837536) (← links)
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Path querying on acyclic graphs using Boolean grammars (Q2027852) (← links)
- Equivalence of deterministic pushdown automata revisited (Q2458041) (← links)
- Top-down syntax nalysis (Q2551318) (← links)
- LR-regular grammars - an extension of LR(k) grammars (Q2558004) (← links)
- A note on the number of states of the De Remer's recognizer (Q2559269) (← links)