An Improved Upper Bound for the Finite Delay of Graphs

Authors:
B. Vilfan
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1970

Citing 2
Cited 1

Introduction to Mathematical Machine Theory

Introduction to Mathematical Machine Theory
Finite automata and their decision problems

IBM Journal of Research and Development

A Note on the Solution of Sequential Boolean Equations

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.