Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2004: Implementation and Application of Automata pp 327–328Cite as

Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata

  • Conference paper

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

Abstract

A new method that transforms a special type of non-deterministic two-dimensional online tesselation automata into deterministic ones is presented. This transformation is then used in a new general approach to exact and approximate two-dimensional pattern matching based on two-dimensional online tessellation automata that generalizes pattern matching approach based on finite automata well known from one-dimensional case.

This research has been partially supported by by FRVŠ grant No. 2060/04, by CTU grant No. CTU0409213, and by Ministry of Education, Youth, and Sports of the Czech Republic under research program No. J04/98:212300014.

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   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

Learn about institutional subscriptions

References

  1. Bird, R.S.: Two dimensional pattern matching. Information Processing Letters 6, 168–170 (1977)

    Article  Google Scholar 

  2. Galil, Z., Park, K.: Truly alphabet-independent two-dimensional pattern matching. In: Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science, pp. 247–256 (1992)

    Google Scholar 

  3. Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences 13, 95–121 (1977)

    Article  MathSciNet  Google Scholar 

  4. Toda, M., Inoue, K., Takanami, I.: Two-dimensional pattern matching by twodimensional on-line tesselation acceptors. Theoretical Computer Science 24, 179–194 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  5. Amir, A., Landau, G.: Fast parallel and serial multidimensional approximate array matching. Theor. Comput. Sci. 81, 97–115 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Tomáš Polcar & Bořivoj Melichar

Authors
  1. Tomáš Polcar
    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. Department of Computer Science, University of Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. Department of Mathematics, University of Turku, Finland

    Alexander Okhotin

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

    Kai Salomaa

  4. Department of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Polcar, T., Melichar, B. (2005). Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30500-2_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24318-2

  • Online ISBN: 978-3-540-30500-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation