TY - GEN
T1 - Learning regular languages using nondeterministic finite automata
AU - García, Pedro
AU - De Parga, Manuel Vázquez
AU - Álvarez, Gloria I.
AU - Ruiz, José
N1 - Funding Information:
Work partially supported by Spanish Ministerio de Educación y Ciencia under project TIN2007-60769.
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=50249113834&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-70844-5_10
DO - 10.1007/978-3-540-70844-5_10
M3 - Conference contribution
AN - SCOPUS:50249113834
SN - 354070843X
SN - 9783540708438
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 92
EP - 101
BT - Implementation and Application of Automata - 13th International Conference, CIAA 2008, Proceedings
T2 - 13th International Conference on Implementation and Application of Automata, CIAA 2008
Y2 - 21 July 2008 through 24 July 2008
ER -