Affordable Access

Publisher Website

Learning in varieties of the form [formula omitted]from positive data

Authors
Journal
Theoretical Computer Science
0304-3975
Publisher
Elsevier
Publication Date
Volume
362
Identifiers
DOI: 10.1016/j.tcs.2006.05.032
Keywords
  • Grammatical Inference
  • Varieties Of Languages
Disciplines
  • Computer Science
  • Logic
  • Mathematics

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Estimates of [formula omitted]from GOCE data

on Earth and Planetary Science Le...

Estimates of [formula omitted] from GOCE data

on Earth and Planetary Science Le... Aug 01, 2014
More articles like this..