Login / Signup
On the complexity of a family of k-context-free sequences.
Marion Le Gonidec
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
context free
context dependent
grammatical inference
context sensitive
finite state
context free languages
context free grammars
graph grammars
attribute grammars
biological sequences
dynamic programming
relational databases
dependency parsing
parse tree
first order logic
knowledge based systems
domain specific