Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Learning Regular Languages Using Nondeterministic Finite Automata

Pedro García1, Manuel Vázquez de Parga1, Gloria I. Álvarez2 and José Ruiz1

(1)  DSIC, Universidad Politécnica de Valencia, Valencia, (Spain)
(2)  Pontificia Universidad Javeriana, Cali, Colombia
Abstract
A new general method for inference of regular languages using nondeterministic automata as output has recently been developed and proved to converge. The aim of this paper is to describe and analyze the behavior of two implementations of that method and to compare it with two well known algorithms for the same task. A complete set of experiments has been carried out and the results of the new algorithms improve the existing ones both in recognition rates as in sizes of the output automata.
Work partially supported by Spanish Ministerio de Educación y Ciencia under project TIN2007-60769.

Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.111 • Server: mpweb19
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)