Graph property recognition machines

Front Cover
Cornell University, Center for Applied Mathematics, 1968 - Computers - 20 pages
0 Reviews
A study is presented of machines that accept, as inputs, finite connected embedded graphs. These are, roughly, Turing machines in which the Turing tape is replaced by such a graph. Relations of such machines to linear bounded automata are discussed. A description is given of a machine that identifies the parity of the number of maximal trees of a planar graph input, together with a proof that it works. (Author).

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Common terms and phrases

Bibliographic information