Learning automata teams

Authors:
Pedro García;Manuel Vázquez de Parga;Damián López;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;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
Venue:
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Year:
2010

Citing 4
Cited 3

Random DFA's can be approximately learned from sparse uniform examples

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
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
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

Polynomial characteristic sets for DFA identification

Theoretical Computer Science
Regular inference as vertex coloring

ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
STAMINA: a competition to encourage the development and assessment of software model inference techniques

Empirical Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove in this work that, under certain conditions, an algorithm that arbitrarily merges states in the prefix tree acceptor of the sample in a consistent way, converges to the minimum DFA for the target language in the limit. This fact is used to learn automata teams, which use the different automata output by this algorithm to classify the test. Experimental results show that the use of automata teams improve the best known results for this type of algorithms. We also prove that the well known Blue-Fringe EDSM algorithm, which represents the state of art in merging states algorithms, suffices a polynomial characteristic set to converge.