Skip to main content
SpringerLink
Log in
Book cover

Formal Languages and Applications pp 367–379Cite as

Patterns

  • Chapter

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 148))

Summary

We review topics on formal language aspects of patterns. The main results on the equivalence and inclusion problems are presented. We discuss open problems, in particular, concerning pattern language decision problems and ambiguity in patterns.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V.: Algorithms for finding patterns in strings. In J. van Leeuwen (Ed.) Handbook of Theoretical Computer Science Vol. A (Elsevier 1990 ), pp 255–300.

    Google Scholar 

  2. Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21 (1980), 46–62.

    Article  MathSciNet  MATH  Google Scholar 

  3. Angluin, D.: Inductive inference of formal languages from positive data. Information and Control, 45 (1980) 117–135.

    Article  MathSciNet  MATH  Google Scholar 

  4. Baader, F., Nipkow, T.: Term Rewriting and All That (Cambridge University Press, 1998 ).

    Google Scholar 

  5. Câmpeanu, C., Salomaa, K., Yu, S.: Regex and extended regex. Proc. of CIA A’02. To appear in LNCS.

    Google Scholar 

  6. Cassaigne, J.: Unavoidable patterns. In M. Lothaire (Ed.) Algebraic Combinatorics on Words (Cambridge University Press, 2002 ).

    Google Scholar 

  7. Choffrut, C., Karhumäki, J.: Combinatorics on words. In G. Rozenberg, A. Salomaa (Eds.) Handbook of Formal Languages, Vol. I (Springer-Verlag 1997 ), pp 329–438.

    Chapter  Google Scholar 

  8. Culik II, K., Karhumäki, J.: Systems of equations over a free monoid and Ehrenfeucht’s conjecture. Discrete Mathematics, 43 (1983), 139–153.

    Article  MathSciNet  MATH  Google Scholar 

  9. Dassow, J., Päun, Gh., Salomaa, A.: Grammars based on patterns. International Journal of Foundations of Computer Science, 4 (1993), 1–14.

    Article  MathSciNet  MATH  Google Scholar 

  10. Della Penna, G., Intrigila, B., Tronci, E., Venturini Zilli, M.: Synchonized regular expressions. Acta Informatica, 39 (2003), 31–70.

    Article  MathSciNet  MATH  Google Scholar 

  11. Duske, J., Parchmann, R.: Non-synchronized pattern languages are IO-macro languages. Journal of Automata, Languages and Combinatorics, 2 (1997), 143–150.

    MathSciNet  MATH  Google Scholar 

  12. Erlebach, T., Rossmanith, P., Stadtherr, H.: A. Steger and T. Zeugmann, Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theoretical Computer Science, 261 (2001), 119–156.

    Article  MathSciNet  MATH  Google Scholar 

  13. Filè, G.: The relation of two patterns with comparable languages. Proc. STACS’88, LNCS 294 (1988), pp. 184–192.

    Google Scholar 

  14. Goldman, S., Kwek, S.: On learning unions of pattern languages and tree patterns in the mistake bound model. Theoretical Computer Science, 288 (2002), 237–254.

    Article  MathSciNet  MATH  Google Scholar 

  15. Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25 (1978), 116–133.

    Article  MathSciNet  MATH  Google Scholar 

  16. Jantke, K.: Polynomial time inference of general pattern languages. Proc. STACS’84, LNCS 166 (1984), pp 314–325.

    MathSciNet  Google Scholar 

  17. Jiang, T., Kinber, E., Salomaa, A., Salomaa, K., Yu, S.: Pattern languages with and without erasing. Intern. J. Computer Math., 50 (1994), 147–163.

    Article  MATH  Google Scholar 

  18. Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. Journal of Computer and System Sciences, 50 (1995), 53–63.

    Article  MathSciNet  MATH  Google Scholar 

  19. Kari, L., Mateescu, A., PAun, Gh., Salomaa, A.: Multi-pattern languages. Theoretical Computer Science, 141 (1995), 253–268.

    Article  MathSciNet  MATH  Google Scholar 

  20. Ko, K.-I., Tzeng, W.-G.: Three EZ -complete problems in computational learning theory. Computational Complexity, 1 (1991), 269–310.

    Article  MathSciNet  MATH  Google Scholar 

  21. Kucherov, G., Rusinowitch, M.: Undecidability of ground reducibility for word rewriting systems with variables. Information Processing Letters, 53 (1995), 209–215.

    Article  MathSciNet  MATH  Google Scholar 

  22. Kucherov, G., Rusinowitch, M.: Patterns in words versus patterns in trees: a brief survey and new results. International Conference “Perspectives of Systems Informatics”, July 1999, Novosibirsk, Russia. LNCS 1755 (1999), pp 280–293.

    Google Scholar 

  23. Lange, S., Wiehagen, R.: Polynomial time inference of arbitrary pattern languages. New Generation Computing, 8 (1991), 361–370.

    Article  MATH  Google Scholar 

  24. Marron, A., Ko, K.-I.: Identification of pattern languages from examples and queries. Information and Computation, 74 (1987), 91–112.

    Article  MathSciNet  MATH  Google Scholar 

  25. Mateescu, A., Salomaa, A.: Nondeterminism in patterns. Proc. STACS’94, LNCS 775 (1994), pp 661–668.

    MathSciNet  Google Scholar 

  26. Mateescu, A., Salomaa, A.: Finite degrees of ambiguity in pattern languages. Theoretical Informatics and Applications, 28 (1994), 233–253.

    MathSciNet  MATH  Google Scholar 

  27. Mitrana, V.: Iterated pattern languages. Journal of Automata, Languages and Combinatorics, 1 (1996), 305–311.

    MathSciNet  MATH  Google Scholar 

  28. Mitrana, V.: Patterns and languages: An overview. Grammars, 2 (1999), 149–173.

    Article  MathSciNet  MATH  Google Scholar 

  29. Mitrana, V., PAun, Gh., Rozenberg, G., Salomaa, A.: Pattern systems. Theoretical Computer Science, 154 (1996), 183–201.

    Article  MathSciNet  MATH  Google Scholar 

  30. Ohlebusch, E., Ukkonen, E.: On the equivalence problem for E-pattern languages. Theoretical Computer Science, 186 (1997), 231–248.

    Google Scholar 

  31. Reischuk, R., Zeugmann, T.: An average-case optimal one-variable pattern language learner. Journal of Computer and System Sciences, 60 (2000), 302–335.

    Article  MathSciNet  MATH  Google Scholar 

  32. Salomaa, A.: Patterns, and Return to patterns. Bull. EATCS 54 (1994), 194206, and Bull. EATCS 55 (1995), 144–157.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Queen’s University, Kingston, Ontario, K7L 3N6, Canada

    Kai Salomaa

Authors
  1. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Lingustics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

  3. Institute of Mathematics, Romanian Academy, PO Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Salomaa, K. (2004). Patterns. In: Martín-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39886-8_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53554-3

  • Online ISBN: 978-3-540-39886-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation