Location of Repository

A POLYNOMIAL ALGORITHM TO INFER REGULAR LANGUAGES.

By Jose Oncina and P. Gracía

Abstract

In this paper we describe an algorithm such that if we give it a set of positive data and a set of positive data of an unknown regular language, it obtains a Deterministic Finite Automaton compatible with the data and with an update time O((m+m')m 2) where m is the sum of the length of all the positive data and m ' is the sum of the length of all negative data. Moreover, this algorithm identifies in the limit whatever regular language

Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.8187
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • ftp://altea.dlsi.ua.es/people/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.