On external presentations of infinite graphs
The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices. For infinite state systems, however, the situation is different: in particular, for such systems having a finite description, each state...
Main Author: | Christophe Morvan |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2009-11-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/0911.3283v1 |
Similar Items
-
Infinite Planar Graphs
by: Aurand, Eric William
Published: (2000) -
Topology and Infinite Graphs
by: Lowery, Nicholas Blackburn
Published: (2009) -
Infinite families of asymmetric graphs
by: Alejandra Brewer, et al.
Published: (2020-09-01) -
Graphoidally independent infinite graphs
by: Purnima Gupta, et al.
Published: (2021-05-01) -
The Cycle Spaces of an Infinite Graph
by: Casteels, Karel
Published: (2006)