Abstract
In the 1960s and 1970s, flowcharts were widely used for describing the structure of computer programs. In this chapter we generalize these information objects in two directions: instead of graphswe will use hypergraphs, and instead of finite state automata we will use a more algebraic formulation, the machines introduced by Eilenberg (1974) and now often called ‘Eilenberg machines’ or X-machines.
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
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kornai, A. (2020). Graphs and Machines. In: Semantics. Springer, Cham. https://doi.org/10.1007/978-3-319-65645-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-65645-8_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65644-1
Online ISBN: 978-3-319-65645-8
eBook Packages: Computer ScienceComputer Science (R0)