Skip to main content
SpringerLink
Log in

Recognizability of graph and pattern languages

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Graph language recognizability is defined and investigated by virtue of the syntactic magmoid, analogously with the syntactic monoid of a word language. In this setup, the syntax complexity of a given recognizable graph language can be determined, giving rise to a syntactic classification inside the class of recognizable graph languages.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arnold, A., Dauchet, M.: Théorie des magmoides. I. RAIRO Inform. Théor. 12(3), 235–257 (1978)

    Google Scholar 

  2. Arnold, A., Dauchet, M.: Théorie des magmoides. II. RAIRO Inform. Théor. 13(2), 135–154 (1979)

    Google Scholar 

  3. Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Math. Syst. Theory 20, 83–127 (1987)

    Article  Google Scholar 

  4. Bossut, F., Dauchet, M., Warin, B.: A Kleene theorem for a class of planar acyclic graphs. Inform. and Comput. 117, 251–265 (1995)

    Article  Google Scholar 

  5. Bell, E.T.: Exponential numbers. Amer. Math. Monthly 41, 411–419 (1934)

    MathSciNet  Google Scholar 

  6. Benson, D.B.: The basic algebraic structures in categories of derivations. Inform. and Control 28, 1–29 (1975)

    Article  Google Scholar 

  7. Bozapalidis, S., Kalampakas, A.: An axiomatization of graphs. Acta Informatica 41, 19–61 (2004)

    Article  Google Scholar 

  8. Corradini, A., Gadducci, F.: An algebraic presentation of term graphs, via gs-monoidal categories. Appl. Categ. Structures 7(4), 299–331 (1999)

    Article  Google Scholar 

  9. Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. and Comput. 85, 12–75 (1990)

    Google Scholar 

  10. Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press (1974)

  11. Engelfriet, J., Vereijken, J.J.: Context-free graph grammars and concatenation of graphs. Acta Informatica 34, 773–803 (1997)

    Article  Google Scholar 

  12. Engelfriet, J., Schmidt, E.M.: IO and OI I. J. Comput. Syst. Sci. 15(3), 328–353 (1977)

    Google Scholar 

  13. Gadducci, F., Heckel, R.: An inductive view of graph transformation. Recent Trends in Algebraic Development Techniques (Tarquinia 1997), pp. 223–237. Lecture Notes in Computer Science 1376, Springer (1997)

  14. Gibbons, J.: An initial-algebra approach to directed acyclic graphs. Mathematics of program construction (Kloster Irsee, 1995), pp. 282–303. LNCS 947, Springer, Berlin (1995)

  15. Hotz, G.: Eine Algebraisierung des Syntheseproblems von Schaltkreisen. EIK 1, pp. 185–205, 209–231 (1965)

  16. Hotz, G.: Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. EIK 2, 235–246 (1966)

    Google Scholar 

  17. Kamimura, T., Slutzki, G.: Parallel and two-way automata on directed ordered acyclic graphs. Inform. and Control 49, 10–51 (1981)

    Article  Google Scholar 

  18. MacLane, S.: Categories for the Working Mathematician. Springer Verlag (1971)

  19. Mezei, J., Wright, J.: Algebraic automata and context-free sets. Inform. and Control 11, 3–29 (1967)

    Article  Google Scholar 

  20. Perrin, D.: (Chapter 1) Finite Auomata. Handbook of Theoretical Computer Science. In: van Leeuwen, J. (ed.), Vol. B, MIT Press (1990)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Aristotle University of Thessaloniki, Thessaloniki, 54124, Greece

    Symeon Bozapalidis & Antonios Kalampakas

Authors
  1. Symeon Bozapalidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonios Kalampakas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Symeon Bozapalidis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bozapalidis, S., Kalampakas, A. Recognizability of graph and pattern languages. Acta Informatica 42, 553–581 (2006). https://doi.org/10.1007/s00236-006-0006-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-006-0006-z

Keywords

Search

Navigation