Skip to main content
SpringerLink
Log in

Automata and pattern matching in planar directed acyclic graphs

  • Conference paper
  • First Online:
LATIN '92 (LATIN 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 583))

Included in the following conference series:

  • 141 Accesses

Abstract

We extend the algorithm of Knuth, Morris and Pratt of pattern matching on strings to a class of planar acyclic graphs and we analyse the relationship between this algorithm and deterministic finite automaton of graphs.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ARNOLD A. and DAUCHET M. (1978), “Théorie des magmoides”, RAIRO IT 12-3, 235–257.

    Google Scholar 

  2. ARNOLD A. and DAUCHET M. (1979), “Théorie des magmoides”, RAIRO IT 13-2, 135–154.

    Google Scholar 

  3. BOSSUT F., DAUCHET M. and WARIN B. (1988), “Automata and rational expressions on planar graphs”, Mathematical Foundations of Computer Science, Carlsbad, august 1988, Lecture Notes Comp. Science, 324, 190–200.

    Google Scholar 

  4. BOSSUT F. and WARIN B. (1991), “Automata and pattern matching in planar directed acyclic graphs”, intern. publication IT 206 of LIFL, University of Lille 1, 59655 Villeneuve d'Ascq, FRANCE.

    Google Scholar 

  5. CAI J., PAIGE R. and TARJAN R. (1990), “More efficient bottom-up Tree Pattern Matching”, in Proc. CAAP 90, LNCS 431.

    Google Scholar 

  6. CHASE D. (1987), “An improvement to bottom-up pattern matching”, in Proc. Fourteenth Annual ACM Symposium on principles of programming Languages, pp 168–177.

    Google Scholar 

  7. HEUTER U. (1991) “First-order properties of trees, star-free expressions, and aperiodicity”, Informatique théorique et Applications, vol.25, n 2, p 125–145.

    Google Scholar 

  8. HOFFMANN C.M. and O'DONNELL M. J. (1982), “Pattern Matching in Trees”, JACM Vol 29, 68–95.

    Google Scholar 

  9. HOTZ G. (1965), “Eine Algegraisierung des Syntheseproblems von Schaltkreisen”, EIK 1, 185–205, 209–231.

    Google Scholar 

  10. KAMIMURA T. and SLUTZKI G. (1981), “Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs”, Information and Control 49, 10–51.

    Google Scholar 

  11. KNUTH D. E., MORRIS J. H., and PRATT V. R. (1977), “Fast Pattern Matching in Strings”, SIAM J. Computing 6∶2 (1977) 323–350.

    Google Scholar 

  12. MARTELLI and MONTANARI (1982), “An efficient unification algorithm”, Transactions on programming languages and syst, 256–282.

    Google Scholar 

  13. ROBINSON J.A. (1965), “A machine-oriented logic based on the resolution principle”, JACM 12, 32–41.

    Google Scholar 

  14. SCHNORR C.P. (1969), “Transformational classes of grammar”, Information and control 14, 252–277.

    Google Scholar 

  15. THOMAS W.(1991), “On logics, Tilings, and Automata”, Bericht Nr.9108, Christian-Albrechts Universitat.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Fondamentale de Lille, U.A. C.N.R.S. 369, University of Lille Flandres Artois, 59655, Villeneuve d'Ascq Cedex, France

    F. Bossut & B. Warin

Authors
  1. F. Bossut
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Warin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Imre Simon

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bossut, F., Warin, B. (1992). Automata and pattern matching in planar directed acyclic graphs. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023819

Download citation

  • DOI: https://doi.org/10.1007/BFb0023819

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55284-0

  • Online ISBN: 978-3-540-47012-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation