Splittability of Bilexical Context-Free Grammars is Undecidable.
Mark-Jan NederhofGiorgio SattaPublished in: Comput. Linguistics (2011)
Keyphrases
- context free grammars
- grammatical inference
- context free languages
- sufficient conditions
- context free
- syntactic pattern recognition
- formal languages
- xml schema
- predicate invention
- attribute grammars
- regular expressions
- production rules
- grammar induction
- lexical semantics
- tree automata
- data management
- relational databases
- closure properties
- relational data
- np complete
- artificial intelligence
- database