Let
A
be the language of strings representing
undirected connected graphs.
Note:
in this way we form a computational
problem as a language recognition problem.
In the next slide we present a high level
This is the end of the preview.
Sign up
to
access the rest of the document.
Unformatted text preview: description of a TM that decides A . Example: Connected Graphs 6 { } graph undirected connected a is G G A  =...
View
Full Document
 Winter '99
 Paturi
 Graph Theory, Planar graph, Glossary of graph theory, Vertextransitive graph

Click to edit the document details