(0,1)-Totality is Undecidable for Arbitrary Context-Free Grammars.
Erkki MäkinenPublished in: Fundam. Informaticae (1996)
Keyphrases
- context free grammars
- grammatical inference
- context free languages
- covering arrays
- syntactic pattern recognition
- predicate invention
- regular expressions
- formal languages
- sufficient conditions
- context free
- grammar induction
- xml schema
- np complete
- lexical semantics
- regular languages
- artificial intelligence
- attribute grammars
- decision trees
- xml documents
- production rules
- relational data
- pattern matching