Login / Signup
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity.
Georg Bachmeier
Michael Luttenberger
Maximilian Schlund
Published in:
CoRR (2014)
Keyphrases
</>
finite automata
computational complexity
deterministic automata
grammatical inference
probabilistic automata
regular expressions
np complete
tree automata
finite automaton
hidden markov models
regular languages
decision problems
database
domain specific
artificial intelligence
data model
databases