Lecture12-1_Part6

Lecture12-1_Part6 - description of a TM that decides A ....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
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
Background image of page 1
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

Ask a homework question - tutors are online