Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)
On discerning words by automata
KeywordsTerminal State Small Power State Automaton Free Monoid Finite Alphabet
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1986