Using domain information during the learning of a subsequential transducer

  title={Using domain information during the learning of a subsequential transducer},
  author={Jos{\'e} Oncina and Miguel Angel Var{\'o}},
The recently proposed OSTI algorithm allows for the identiication of subsequential functions from input-output pairs. However, if the target is a partial function the convergence is not guaranteed. In this work, we extend the algorithm in order to allow for the identiication of any partial subsequential function provided that either a negative sample or a description of the domain by means of a deterministic nite automaton is available. 

From This Paper

Figures, tables, and topics from this paper.
22 Citations
5 References
Similar Papers


Publications referenced by this paper.
Showing 1-5 of 5 references

\ Inference of kTestable Languages in theStrict Sense and application to Syntactic Pattern Recognition "

  • E. Vidal.
  • IEEETrans . Pattern Analysis and Machine…
  • 1982

Gold . \ Complexity of automaton identi cation from givendata "

  • M. E.
  • Information and Control
  • 1979

Angluin , \ Inference of Reversible Languages "

  • D.
  • J . ACM

Gold . \ Language identi cation in the limit "

  • M. E.
  • Informationand Control

Similar Papers

Loading similar papers…