The following pages link to Grammars (Q174794):
Displayed 50 items.
- Non-commutative linear logic in linguistics (Q700787) (← links)
- Towards biolinguistics (Q700790) (← links)
- A descriptive characterisation of indexed grammars (Q700792) (← links)
- Finite state transducers with predicates and identities (Q700795) (← links)
- On the generative capacity of bracketed contextual grammars (Q1289661) (← links)
- The automatic deduction of classificatory systems from linguistic theories (Q1289662) (← links)
- Quantitative comparison of languages (Q1289663) (← links)
- Chomsky-Schutzenberger type characterizations based on contextual languages (Q1289664) (← links)
- Structured contextual grammars (Q1289665) (← links)
- Determinism in eco-grammar systems (Q1307848) (← links)
- Cooperating distributed hyperedge replacement grammars (Q1307849) (← links)
- New topics in colonies theory (Q1307850) (← links)
- On the hierarchy of extended conditional tabled eco-grammar systems (Q1307851) (← links)
- On hybrid eco-rewriting systems (Q1307853) (← links)
- Communication in parallel communicating Lindenmayer systems (Q1307854) (← links)
- Why grammar systems? (Q1307855) (← links)
- Special issue on grammar systems (Q1307856) (← links)
- An approach to syllables via some extensions of Marcus contextual grammars (Q1405584) (← links)
- The power of catalysts and priorities in membrane systems (Q1405585) (← links)
- Parallel grammars: A phenomenology (Q1405586) (← links)
- Constraints on derivations (Q1430206) (← links)
- A note on the equivalence and complexity of linear grammars (Q1430207) (← links)
- Grammar efficiency and complexity (Q1430208) (← links)
- On the semantics of unification grammars (Q1430209) (← links)
- Modeling chaotic series by simple eco-grammar systems with reproduction, death and maturation of agents (Q1430212) (← links)
- A descriptive characterisation of even linear languages (Q1430213) (← links)
- Interactive graph grammar (Q1430215) (← links)
- Special issue: Workshop on formal languages and automata. Iaşi, Romania, September 2--3, 1999 (Q1592918) (← links)
- Cut-and-paste languages (Q1592919) (← links)
- Generalized P-systems with splicing and cutting/recombination (Q1592920) (← links)
- Shuffle-based multilanguages (Q1592922) (← links)
- The generative power of context-free node rewriting in hypergraphs (Q1592924) (← links)
- On special forms of restarting automata (Q1592926) (← links)
- Conditional tabled eco-grammar systems: The scattered contexts (Q1592927) (← links)
- On the power of reading the whole infinite input tape (Q1592928) (← links)
- On the Concatenation of one-turn pushdowns (Q1592930) (← links)
- On the decidability of the equivalence problem for orthogonal sequential programs (Q1592932) (← links)
- Run-time extensible deterministic top-down parsing (Q1592934) (← links)
- An informal sketch of a formal architecture for construction grammar (Q1604832) (← links)
- Top-down parsing of conjunctive languages (Q1604833) (← links)
- Modular context-free grammars (Q1604834) (← links)
- Parallel communicating grammar systems as language analyzers (Q1841061) (← links)
- Eventualities in time. The localization of eventualities in the Platonist and the reductionist picture of time (Q1841062) (← links)
- Regulated grammars under leftmost derivation (Q1841063) (← links)
- Uniquely parsable unification grammars and their parser implemented in Prolog (Q1841065) (← links)
- P systems with symport/Antiport rules: The traces of objects (Q1850931) (← links)
- LR parsing for conjunctive grammars (Q1850932) (← links)
- Computational complexity of probabilistic disambiguation (Q1850934) (← links)
- Parallel communicating grammar systems with incomplete information communication (Q1868516) (← links)
- Formalizing mirror theory (Q1868517) (← links)