Minimal consistent DFA from sample strings
Sign Up to like & getrecommendations! Published in 2020 at "Acta Informatica"
DOI: 10.1007/s00236-020-00365-8
Abstract: We review the grammatical inference problem for regular languages which aims to generate a deterministic finite automaton from a representative set of training sample strings known to be in or not in the language. Although… read more here.
Keywords: dfa; consistent dfa; sample strings; minimal consistent ... See more keywords