Skip to main content
SpringerLink
Log in

On Two-Dimensional Pattern Matching by Finite Automata

  • Conference paper
Implementation and Application of Automata (CIAA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3845))

Included in the following conference series:

Abstract

This paper presents a general concept of two-dimensional pattern matching using conventional (one-dimensional) finite automata. Then two particular models and methods, implementations of the general principle, are presented. The first of these two models presents an automata based version of the Bird and Baker approach with lower space complexity than the original algorithm. The second introduces a new model for two-dimensional approximate pattern matching using the two-dimensional Hamming distance.

This research is partially supported by the MŠMT under research program MSM 6840770014.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amir, A.: Theoretical issues of searching aerial photographs: a bird’s eye view. In: Balík, M., Holub, J., Šimánek, M. (eds.) Proceedings of the Prague Stringology Conference 2004, Czech Technical University in Prague, Czech Republic, pp. 1–23 (2004)

    Google Scholar 

  2. Crochemore, M., Hancart, C.: Automata for matching patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 399–462. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  3. Melichar, B.: Approximate string matching by finite automata. In: Hlaváč, V., Šára, R. (eds.) CAIP 1995. LNCS, vol. 970, pp. 342–349. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  4. Melichar, B., Holub, J.: 6D classification of pattern matching problems. In: Holub, J. (ed.) Proceedings of the Prague Stringology Club Workshop 1997, Czech Technical University in Prague, Czech Republic, pp. 24–32 (1997)

    Google Scholar 

  5. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Handbook of Formal Languages, vol. III (Beyond Words), pp. 216–267. Springer, Heidelberg (1997)

    Google Scholar 

  6. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18, 333–340 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ždárek, J., Melichar, B.: Finite automata and two-dimensional pattern matching. In: Heričko, M., Rozman, I., Jurič, M.B., Rajkovič, V., Urbančič, T., Bernik, M., Bučar, M., Brodnik, A. (eds.) Proceedings of the 7th International Multiconference Information Society IS 2004, Ljubljana, Slovenia, Institut “Jožef Stefan”, vol. D, pp. 185–188 (2004)

    Google Scholar 

  8. Cambouropoulos, E., Crochemore, M., Iliopoulos, C.S., Mouchard, L., Pinzon, Y.J.: Algorithms for computing approximate repetitions in musical sequences. In: Raman, R., Simpson, J. (eds.) Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms, Perth, WA, Australia, pp. 129–144 (1999)

    Google Scholar 

  9. Sellers, P.H.: The theory and computation of evolutionary distances: Pattern recognition. J. Algorithms 1, 359–373 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. Wu, S., Manber, U.: Fast text searching: allowing errors. Commun. ACM 35, 83–91 (1992)

    Article  Google Scholar 

  11. Holub, J.: Simulation of nondeterministic finite automata in pattern matching. Dissertation thesis, Czech Technical University in Prague, Czech Republic (2000)

    Google Scholar 

  12. Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6, 323–350 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hamming, R.W.: Error detecting and error correcting codes. The Bell System Technical Journal 29, 147–160 (1950)

    Article  MathSciNet  Google Scholar 

  14. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computations. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  15. Ukkonen, E.: Finding approximate patterns in strings. J. Algorithms 6, 132–137 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  16. Baeza-Yates, R.A., Navarro, G.: New models and algorithms for multidimensional approximate pattern matching. J. Discret. Algorithms 1, 21–49 (2000)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Karlovo náměstí 13, 121 35, Praha 2, Czech Republic

    Jan Žd’árek & Bořivoj Melichar

Authors
  1. Jan Žd’árek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bořivoj Melichar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sophia Antipolis, Laboratoire I3S, Les Algorithmes - bât. Euclide B, Université de Nice, 2000, route des lucioles, BP 121, 06903, Sophia Antipolis - Cedex, France

    Jacques Farré

  2. Sophia Antipolis, Ecole Polytechnique, Université de Nice, 930, route des colles, BP 145, 06903, Sophia Antipolis - Cedex, France

    Igor Litovsky

  3. Laboratoire I3S, Université de Nice, Sophia Antipolis & CNRS, France

    Sylvain Schmitz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Žd’árek, J., Melichar, B. (2006). On Two-Dimensional Pattern Matching by Finite Automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_28

Download citation

  • DOI: https://doi.org/10.1007/11605157_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31023-5

  • Online ISBN: 978-3-540-33097-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation