Longer Shortest Strings in Two-Way Finite Automata.

Stanislav Krymski Alexander Okhotin

Published in: DCFS (2020)

Keyphrases

finite automata
shortest common supersequence
deterministic automata
grammatical inference
regular expressions
probabilistic automata
regular languages
longest common subsequence
tree automata
hidden markov models
shortest path
finite automaton
metadata
relational databases