Learning in varieties of the form V*LI from positive data

Authors:
Pedro García;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
Venue:
Theoretical Computer Science
Year:
2006

Citing 11
Cited 1

Inference of regular grammars via skeletons

IEEE Transactions on Systems, Man and Cybernetics
Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Finite automata, formal logic, and circuit complexity

Finite automata, formal logic, and circuit complexity
Learning approximately regular languages with reversible languages

Theoretical Computer Science
Inference of Reversible Languages

Journal of the ACM (JACM)
Right and left locally testable languages

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Varieties Of Formal Languages

Varieties Of Formal Languages
On Reversible Automata

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

On locally reversible languages

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Grammatical inference and finite semigroup theory are continuously developing. Nevertheless it seems that they are not interacting too much. We propose in this paper an inference method for languages that belong to varieties of the form V*LI. Many well known families of languages like locally testable, reversible, dot-depth one, etc. are of that form. The method unifies existing algorithms for inference of some of those families and can be applied to some others that had not been inferred yet. It uses a result about the cascade product in which one of the factors is a transducer and the second is the automaton obtained by inferring the base case of the family using the transduction of the sample as input.