Universal automata and NFA learning

Authors:
Pedro García;Manuel Vázquez de Parga;Gloria I. Álvarez;José Ruiz
Affiliations:
Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Pontificia Universidad Javeriana - Seccional Cali, Calle 18 118-250 Cali, Colombia;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
Theoretical Computer Science
Year:
2008

Citing 6
Cited 3

Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm

ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Beyond EDSM

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Identification of DFA: data-dependent vs data-independent algorithms

ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Learning regular languages using RFSAs

Theoretical Computer Science - Special issue: Algorithmic learning theory
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Minimalizations of NFA using the universal automaton

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Learning Regular Languages Using Nondeterministic Finite Automata

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
A non-deterministic grammar inference algorithm applied to the cleavage site prediction problem in bioinformatics

ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Polynomial characteristic sets for DFA identification

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

The aim of this paper is to develop a new algorithm that, with a complete sample as input, identifies the family of regular languages by means of nondeterministic finite automata. It is a state-merging algorithm. One of its main features is that the convergence (which is proved) is achieved independently from the order in which the states are merged, that is, the merging of states may be done ''randomly''.