Pages that link to "Item:Q1960409"
From MaRDI portal
The following pages link to Independent parallelism in finite copying parallel rewriting systems (Q1960409):
Displaying 10 items.
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Trading independent for synchronized parallelism in finite copying parallel rewriting systems (Q1267708) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data (Q2431429) (← links)
- Finding the smallest binarization of a CFG is NP-hard (Q2637648) (← links)
- Distributional Learning of Context-Free and Multiple Context-Free Grammars (Q2963597) (← links)
- CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS (Q3401474) (← links)
- The Pumping Lemma for Well-Nested Multiple Context-Free Languages (Q3637235) (← links)
- Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data (Q3648758) (← links)
- Observations on Strict Derivational Minimalism (Q4923564) (← links)
