Login / Signup
Converting finite width AFAs to nondeterministic and universal finite automata.
Mohammad Zakzok
Kai Salomaa
Published in:
Theor. Comput. Sci. (2024)
Keyphrases
</>
finite automata
regular expressions
grammatical inference
deterministic automata
probabilistic automata
regular languages
tree automata
finite automaton
database
hidden markov models
database systems
expert systems
pattern matching
integrity constraints