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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D.Angulin; Finding patterns common to a set of strings. Proc. of the 11-th ACM Symp. on the Theory of Computing, Atlanta, 1979.
Ch.Codognet; Personal communication, 1986.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filè, G. (1988). The relation of two patterns with comparable languages. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035844
Download citation
DOI: https://doi.org/10.1007/BFb0035844
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive