Advertisement

On discerning words by automata

  • P. Goralčík
  • V. Koubek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)

Keywords

Terminal 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • P. Goralčík
    • 1
  • V. Koubek
    • 1
  1. 1.Faculty of Mathematics and PhysicsCharles UniversityPragueCSSR

Personalised recommendations