Login / Signup
The complexity of concatenation on deterministic and alternating finite automata.
Michal Hospodár
Galina Jirásková
Published in:
RAIRO Theor. Informatics Appl. (2018)
Keyphrases
</>
finite automata
regular expressions
deterministic automata
probabilistic automata
pattern matching
grammatical inference
finite automaton
tree automata
regular languages
databases
domain specific
query language
knowledge representation
integrity constraints