Grammatical inference of directed acyclic graph languages with polynomial time complexity.
Antonio-Javier GallegoDamián LópezJorge Calera-RubioPublished in: J. Comput. Syst. Sci. (2018)
Keyphrases
- grammatical inference
- directed acyclic graph
- polynomial time complexity
- np complete
- context free
- context free grammars
- mildly context sensitive
- inductive inference
- regular languages
- finite automata
- equivalence classes
- positive data
- context free languages
- random variables
- directed graph
- min cut max flow
- shortest path problem
- databases
- object oriented
- relational databases