What is Affix grammar over a finite lattice?

An adaptive grammar is a formal grammar that explicitly provides mechanisms within the formalism to allow its own production rules to be manipulated.

A definite clause grammar is a way of expressing grammar, either for natural or formal languages, in a logic programming language such as Prolog. It is closely related to the...

Indexed grammars are a generalization of context-free grammars in that nonterminals are equipped with lists of flags, or index symbols.The language produced by an indexed grammar is called an indexed...

Generalized context-free grammar is a grammar formalism that expands on context-free grammars by adding potentially non-context-free composition functions to rewrite rules. Head grammar is an instance of such a GCFG...

In formal grammar theory, the deterministic context-free grammars are a proper subset of the context-free grammars. They are the subset of context-free grammars that can be derived from deterministic pushdown...

An aperiodic finite-state automaton is a finite-state automaton whose transition monoid is aperiodic.

In theoretical computer science and formal language theory, a regular tree grammar is a formal grammar that describes a set of directed trees, or terms. A regular word grammar can...

Higher order grammar is a grammar theory based on higher-order logic. It can be viewed simultaneously as generative-enumerative or model theoretic.

Applicative universal grammar, or AUG, is a universal semantic metalanguage intended for studying the semantic processes in particular languages. This is a linguistic theory that views the formation of phrase...

Pregroup grammar is a grammar formalism intimately related to categorial grammars. Much like categorial grammar , PG is a kind of type logical grammar. Unlike CG, however, PG does not...