Login / Signup

Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.

Pál DömösiChrystopher L. NehanivJohn L. Rhodes
Published in: Theor. Comput. Sci. (2003)
Keyphrases
  • finite automata
  • grammatical inference
  • regular expressions
  • probabilistic automata
  • deterministic automata
  • tree automata
  • keywords
  • finite automaton
  • relevance feedback
  • regular languages
  • machine learning
  • positive data