Pages that link to "Item:Q1219690"
From MaRDI portal
The following pages link to General context-free recognition in less than cubic time (Q1219690):
Displaying 50 items.
- On the sizes of DPDAs, PDAs, LBAs (Q294936) (← links)
- Algebraic dynamic programming for multiple context-free grammars (Q301600) (← links)
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Certified CYK parsing of context-free languages (Q465493) (← links)
- Conservative groupoids recognize only regular languages (Q476161) (← links)
- On translating Lambek grammars with one division into context-free grammars (Q511445) (← links)
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- Context-free recognition via shortest paths computation: a version of Valiant's algorithm (Q673077) (← links)
- Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852) (← links)
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata (Q736618) (← links)
- Systolic parsing of context-free languages (Q756431) (← links)
- An efficient all-parses systolic algorithm for general context-free parsing (Q757072) (← links)
- An efficient recognizer for the Boolean closure of context-free languages (Q802880) (← links)
- On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- Fast multiplication of matrices over a finitely generated semiring (Q963453) (← links)
- On efficient recognition of transductions and relations (Q1066679) (← links)
- Pattern selector grammars and several parsing algorithms in the context- free style (Q1081314) (← links)
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture (Q1084875) (← links)
- Time complexity of languages recognized by one-way multihead pushdown automata (Q1158973) (← links)
- A note on two-way nondeterministic pushdown automata (Q1170034) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- Relative complexity of checking and evaluating (Q1232181) (← links)
- Recognition of EOL languages in less than quartic time (Q1248343) (← links)
- TAL recognition in \(O(M(n^2))\) time (Q1267714) (← links)
- An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Membership problems for regular and context-free trace languages (Q1824384) (← links)
- A divide-and-conquer approach to general context-free parsing (Q1836996) (← links)
- Time complexity of loop-free two-way pushdown automata (Q1838833) (← links)
- Boolean grammars (Q1886037) (← links)
- Path querying on acyclic graphs using Boolean grammars (Q2027852) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- On the semantic equivalence of language syntax formalisms (Q2202012) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- Complexity of the path avoiding forbidden pairs problem revisited (Q2446333) (← links)
- BRNGLR: a cubic Tomita-style GLR parsing algorithm (Q2458444) (← links)
- Edit Distance with Duplications and Contractions Revisited (Q3011874) (← links)
- (Q3304119) (← links)
- Safety in grammatical protection systems (Q3319763) (← links)
- A simple proof of Valiant's lemma (Q3745310) (← links)
- (Q3873564) (← links)
- Complexity of some problems concerningL systems (Q3896507) (← links)
- Analysis and synthesis of structured parallel programs (Q3956376) (← links)
