Advertisement

The relation of two patterns with comparable languages

  • Gilberto Filè
Contributed Papers Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)

Abstract

A pattern is a string consisting of terminals and variables. The language defined by a pattern is the set of terminal strings obtained by substituting (consistently) terminal strings to its variables. A pattern simulates another pattern when its language contains that of the other one.

If q simulates p, one may think that there must be a substitution that applied to q produces p itself. This hypothesis is considered under different assumptions. It results that it is true only for very restricted patterns (with variables only) and only when erasing substitutions are considered. The relation between two patterns is studied also in the case that the languages they produce are equal.

Keywords

Restricted Pattern Pattern Language Large Alphabet String Consisti Terminal String 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ang]
    D.Angulin; Finding patterns common to a set of strings. Proc. of the 11-th ACM Symp. on the Theory of Computing, Atlanta, 1979.Google Scholar
  2. [Cod]
    Ch.Codognet; Personal communication, 1986.Google Scholar
  3. [Shi]
    T.Shinohara; Polynomial time inference of pattern languages and its application. Proc. of the 7-th IBM Symp. on Math.Found. of Comp. Sci., 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Gilberto Filè
    • 1
  1. 1.CNRS LA 226 Université de Bordeaux IFrance

Personalised recommendations