Abstract
Graph theory started in 1735 with Euler’s proof that no path could lead a person over all seven bridges of the Prussian town of Königsberg without at least one bridge being crossed twice. Our study of Euler’s theorem in Section 6.1 allows us to introduce such concepts as paths, Euler paths and connectedness for graphs. Section 6.2 uses matrices over semirings to characterize the connectivity of graphs. Finally, Section 6.3 applies these connectivity matrices to analyze the reachability problem for automata, and then returns to a theme initiated in Section 2.3, showing that a language is accepted by a finite-state acceptor iff it can be built up from finite sets by a finite number of applications of the operations of union, dot, and star.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Arbib, M.A., Kfoury, A.J., Moll, R.N. (1981). Graphs, Matrices, and Machines. In: A Basis for Theoretical Computer Science. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9455-6_6
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9455-6_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9457-0
Online ISBN: 978-1-4613-9455-6
eBook Packages: Springer Book Archive