This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
May 1970 (vol. 19 no. 5)
pp. 453-456
The notion of graphs solvable with finite delay appears in [1] and [4]. In this note the upper bound on finite delay for a graph with N nodes is reduced to the order of 2N2using techniques from finite automata theory.
Index Terms:
Delay of graphs, finite automata theory, graph theory, nondeterministic finite automata, sequential Boolean equations.
Citation:
B. Vilfan, "An Improved Upper Bound for the Finite Delay of Graphs," IEEE Transactions on Computers, vol. 19, no. 5, pp. 453-456, May 1970, doi:10.1109/T-C.1970.222944
Usage of this product signifies your acceptance of the Terms of Use.