Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited.

Henning Fernau Stefan Hoffmann Michael Wehar

Published in: CoRR (2021)

Keyphrases

finite automata
parameterized complexity
tree automata
deterministic automata
regular expressions
grammatical inference
fixed parameter tractable
global constraints
symmetry breaking
hidden markov models
finite automaton
database systems
knowledge representation
object oriented
pattern matching