Generating all permutations by context-free grammars in Chomsky normal form.
Peter R. J. AsveldPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- normal form
- context free grammars
- database design
- relational databases
- context free languages
- grammatical inference
- functional dependencies
- nested relations
- context free
- predicate invention
- xml schema
- regular expressions
- regular languages
- building blocks
- production rules
- covering arrays
- knowledge based systems
- query processing