Operational State Complexity and Decidability of Jumping Finite Automata.

Simon Beier Markus Holzer Martin Kutrib

Published in: Int. J. Found. Comput. Sci. (2019)

Keyphrases

finite automata
grammatical inference
probabilistic automata
regular expressions
query answering
tree automata
finite automaton
deterministic automata
artificial intelligence
hidden markov models
state space
pattern matching
regular languages