Pages that link to "Item:Q4311636"
From MaRDI portal
The following pages link to The equivalence of four extensions of context-free grammars (Q4311636):
Displaying 26 items.
- The grammar of mammalian brain capacity (Q290555) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- Linear time parsers for classes of non context free languages (Q671525) (← links)
- Linearity and nondeletion on monadic context-free tree grammars (Q835003) (← links)
- Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
- On the complexity of 2-monotone restarting automata (Q927391) (← links)
- Highly constrained unification grammars (Q1024820) (← links)
- Information flow in tabular interpretations for generalized push-down automata (Q1129130) (← links)
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey (Q1736791) (← links)
- Grammatical characterizations of NPDAs and VPDAs with counters (Q1784750) (← links)
- An operational and denotational approach to non-context-freeness (Q1870568) (← links)
- Structural similarity within and among languages (Q1870573) (← links)
- Tabular parsing and algebraic transformations (Q1870575) (← links)
- Boolean grammars (Q1886037) (← links)
- On finite-index indexed grammars and their restrictions (Q2042723) (← links)
- The tree-generative capacity of combinatory categorial grammars (Q2051866) (← links)
- Commutation-augmented pregroup grammars and mildly context-sensitive languages (Q2467217) (← links)
- Distributional Learning of Context-Free and Multiple Context-Free Grammars (Q2963597) (← links)
- Consensual languages and matching finite-state computations (Q3006160) (← links)
- Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars (Q3455855) (← links)
- Restarting Tree Automata and Linear Context-Free Tree Languages (Q3522874) (← links)
- Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars (Q3587254) (← links)
- Equivalence of Functions Represented by Simple Context-Free Grammars with Output (Q3617047) (← links)
- Pumping lemmas for the control language hierarchy (Q4835863) (← links)
- A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser (Q4923565) (← links)
- Combinatory categorial grammars as generators of weighted forests (Q6053406) (← links)
