SELECT PROPERTIES OF THE GRAPH MODEL OF A GENERAL AUTOMATON
ELDO C. KOENIG
(Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, U.S.A.)
TERRY J. FREDERICK
(University of Wisconsin, Madison, Wisconsin, U.S.A. Now in the Computer Sciences Dept., Purdue University)
31
Abstract
Select properties are presented for a graph model of a general automaton consisting of a processor, environment and time graph. The properties, stated in the form of theorems and corollaries, deal with connectedness, number of points and lines and indegree and outdegree as the model relates to the automaton's sets, functions and characteristics. The properties are illustrated by an example automaton.
Citation
KOENIG, E.C. and FREDERICK, T.J. (1972), "SELECT PROPERTIES OF THE GRAPH MODEL OF A GENERAL AUTOMATON", Kybernetes, Vol. 1 No. 1, pp. 23-33. https://doi.org/10.1108/eb005294
Publisher
:MCB UP Ltd
Copyright © 1972, MCB UP Limited