The following pages link to On multiple context-free grammars (Q1177161):
Displaying 50 items.
- Algebraic dynamic programming for multiple context-free grammars (Q301600) (← links)
- On the effect of the IO-substitution on the Parikh image of semilinear full AFLs (Q302175) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- Comparing consecutive letter counts in multiple context-free languages (Q831122) (← links)
- Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
- On the membership problem for non-linear abstract categorial grammars (Q972435) (← links)
- A grammatical approach to RNA-RNA interaction prediction (Q1013373) (← links)
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Trading independent for synchronized parallelism in finite copying parallel rewriting systems (Q1267708) (← links)
- Grouped partial ET0L systems and parallel multiple context-free grammars (Q1583595) (← links)
- The word problem of \(\mathbb{Z}^n\) is a multiple context-free language (Q1647858) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- The Cooper storage idiom (Q1711505) (← links)
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey (Q1736791) (← links)
- LR parsing for LCFRS (Q1736827) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Global index grammars and descriptive power (Q1770832) (← links)
- On the expressive power of abstract categorial grammars: Representing context-free formalisms (Q1770834) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- An operational and denotational approach to non-context-freeness (Q1870568) (← links)
- Structural similarity within and among languages (Q1870573) (← links)
- Independent parallelism in finite copying parallel rewriting systems (Q1960409) (← links)
- Weighted parsing for grammar-based language models over multioperator monoids (Q2051800) (← links)
- IDL-PMCFG, a grammar formalism for describing free word order languages (Q2093024) (← links)
- \(O_n\) is an \(n\)-MCFL (Q2121469) (← links)
- Hybrid tree automata and the yield theorem for constituent tree automata (Q2164739) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- The failure of the strong pumping lemma for multiple context-free languages (Q2254497) (← links)
- Geometric representations for minimalist grammars (Q2255202) (← links)
- Ogden's lemma, multiple context-free grammars, and the control language hierarchy (Q2280330) (← links)
- Closure properties in the class of multiple context-free groups (Q2304867) (← links)
- Groups whose word problems are not semilinear (Q2317163) (← links)
- Categorial dependency grammars (Q2344756) (← links)
- Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies (Q2353402) (← links)
- Synchronous context-free grammars and optimal linear parsing strategies (Q2353407) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data (Q2431429) (← links)
- An Automata Characterisation for Multiple Context-Free Languages (Q2817383) (← links)
- On the Mild Context-Sensitivity of k-Tree Wrapping Grammar (Q2835045) (← links)
- Efficiency in the Identification in the Limit Learning Paradigm (Q2963593) (← links)
- Distributional Learning of Context-Free and Multiple Context-Free Grammars (Q2963597) (← links)
- A Language Theoretic Approach to Syntactic Structure (Q3172826) (← links)
- Disentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive Power (Q3172834) (← links)
- A General Technique to Train Language Models on Language Models (Q3225429) (← links)
- (Q3384165) (← links)
- An Approach to Computing Downward Closures (Q3449495) (← links)
- Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars (Q3455855) (← links)
- The Pumping Lemma for Well-Nested Multiple Context-Free Languages (Q3637235) (← links)
