The Equivalence of pre-NTS Grammars is Decidable.
Jean-Michel AutebertLuc BoassonPublished in: Math. Syst. Theory (1992)
Keyphrases
- datalog programs
- query containment
- first order logic
- transitive closure
- grammatical inference
- natural language
- query answering
- finite state automata
- context free
- context free grammars
- parse selection
- database
- visual languages
- graph grammars
- neural network
- logic programming
- logic programs
- function symbols
- natural language processing
- data sets