Abstract
In this paper we prove that the set of directed Eulerian graphs is not recognizable. On the other hand, the set of directed graphs with an Eulerian underlying graph is shown to be recognizable. Furthermore, we compute the syntactic complexity of this language and we compare it with that of connected graphs.
This research was partially supported by I.K.Y.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arnold, A., Dauchet, M.: Théorie des magmoides. I. RAIRO Inform. Théor. 12(3), 235–257 (1978)
Arnold, A., Dauchet, M.: Théorie des magmoides. II. RAIRO Inform. Théor. 13(2), 135–154 (1979)
Bell, E.T.: Exponential numbers. Amer. Math. Monthly 41, 411–419 (1934)
Bozapalidis, S., Kalampakas, A.: An Axiomatization of Graphs. Acta Informatica 41, 19–61 (2004)
Bozapalidis, S., Kalampakas, A.: Recognizability of graph and pattern languages. Acta Informatica 42, 553–581 (2006)
Engelfriet, J., Vereijken, J.J.: Context-free graph grammars and concatenation of graphs. Acta Informatica 34, 773–803 (1997)
Hotz, G.: Eine Algebraisierung des Syntheseproblems von Schaltkreisen. EIK 1, 185-205, 209-231 (1965)
MacLane, S.: Categories for the working mathematician. Springer, Heidelberg (1971)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalampakas, A. (2007). The Syntactic Complexity of Eulerian Graphs. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2007. Lecture Notes in Computer Science, vol 4728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75414-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-75414-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75413-8
Online ISBN: 978-3-540-75414-5
eBook Packages: Computer ScienceComputer Science (R0)