Finite automata and unions of regular patterns with bounded constant segments

Authors:
Antonio Cano;Pedro García
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:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 3
Cited 0

Inductive inference of unbounded unions of pattern languages from positive data

Theoretical Computer Science - Special issue on algorithmic learning theory
Varieties Of Formal Languages

Varieties Of Formal Languages
Finding patterns common to a set of strings (Extended Abstract)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The class of unbounded unions of regular pattern languages with bounded constant segments is identifiable from positive data in the limit [1]. Otherwise, no efficient algorithm that performs the inference of this class of languages is known. We propose a solution to this problem using the existing connexion between the positive variety of languages of dot depth 1/2, ${\mathcal LJ}^+$ [2] and the class of unbounded union of pattern languages ${\mathcal RP}^+{\mathcal L}$.