Polynomial time inference of extended regular pattern languages

  • Takeshi Shinohara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 147)

Abstract

A pattern is a string of constant symbols and variable symbols. The language of a pattern p is the set of all strings obtained by substituting any non-empty constant string for each variable symbol in p. A regular pattern has at most one occurrence of each variable symbol. In this paper, we consider polynomial time inference from positive data for the class of extended regular pattern languages which are sets of all strings obtained by substituting any (possibly empty) constant string, instead of non-empty string. Our inference machine uses MINL calculation which finds a minimal language containing a given finite set of strings. The relation between MINL calculation for the class of extended regular pattern languages and the longest common subsequence problem is also discussed.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Aho, A.V., Hopcroft, J.E. and Ullman, J.D. (1974), "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, Mass.Google Scholar
  2. [2]
    Angluin, D. (1979), Finding Patterns Common to a Set of Strings, in "Proceedings, 11th Annual ACM Symposium on Theory of Computing," pp. 130–141.Google Scholar
  3. [3]
    Angluin, D. (1980), Inductive Inference of Formal Languages from Positive Data, Inform. Contr. 45, 117–135.Google Scholar
  4. [4]
    Arikawa, S. (1981), A personal communication.Google Scholar
  5. [5]
    Gold, E.M. (1967), Language Identification in the Limit, Inform. Contr. 10, 447–474.Google Scholar
  6. [6]
    Hirschberg, D.S. (1977), Algorithms for the Longest Common Subsequence Problem, JACM 24, 664–675Google Scholar
  7. [7]
    Hopcroft, J.E. and Ullman, J.D. (1969), "Formal Languages and their Relation to Automata," Addison-Wesley, Reading, Mass.Google Scholar
  8. [8]
    Maier, D. (1978), The Complexity of Some Problems on Subsequences and Supersequences, JACM 25, 322–336.Google Scholar
  9. [9]
    Shinohara, T. (1982), Polynomial Time Inference of Pattern Languages and its Application, in "Proceedings, 7th IBM Symposium on Mathematical Foundation of Computer Science."Google Scholar
  10. [10]
    Wagner, R.A., and Fischer, M.J. (1974), The string-to-string Correction Problem, JACM 21, 168–73.Google Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Takeshi Shinohara
    • 1
  1. 1.Computer CenterKyushu University 91FukuokaJapan

Personalised recommendations