Learning finite state machines

  • Authors:
  • Colin de la Higuera

  • Affiliations:
  • Université de Nantes, CNRS, LINA, UMR, France

  • Venue:
  • FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The terms grammatical inference and grammar induction both seem to indicate that techniques aiming at building grammatical formalisms when given some information about a language are not concerned with automata or other finite state machines. This is far from true, and many of the more important results in grammatical inference rely heavily on automata formalisms, and particularly on the specific use of determinism that is made. We survey here some of the main ideas and results in the field.