Automata Computability and Formal Languages

May 1st, 2015
Studypool Tutor
Price: $10 USD

Tutor description

Connected graph A graph G is connected if given any vertices u and v in G, there is a path from u to v (or v to u). That is, in a connected graph, we can get from any vertex to any other vertex on a path. If there’s no path between some pair of vertices then the graph is called disconnected.

Word Count: 688
Showing Page: 1/5
Automata, Computability and Formal LanguagesCOM273: Automata, Computability, and Formal LanguagesREVIEW NOTESConnected graph A graph G is connected if given any vertices u and v in G, there is a path from u to v (or v to u). That is, in a connected graph, we can get from any vertex to any other vertex on a path. If theres no path between some pair of vertices then the graph is called disconnected. The following shows a connected graph and a disconnected graph. Example: a b c b a ce d connected graphe d disconnected graphCycle A cycle (or a circuit) is a path of non-zero length from u to v with no repeated edges. A simple cycle is cycle from v to v, in which there are no repeated vertices (except for the initial and final vertices which are both equal to v) Example: a b d e c (a, b, d, c, b, e, c, a) is a cycle (but not simple) (a, d, c, b, e, a) is a simple cycle of length 5.Notice that a simple path of length n contains (n+1) distinct vertices, which a simple cycle of length n contains n distinct vertices.Eulerian graphs A cycle in a connected graph G that includes all the edges and all the vertices of G is called an Euler cycle (Euler is pronounced as oiler).A connected graph containing an Euler cycle is called an Eulerian graph.Finding an Euler cycle in a graph is the same as playing the following game. Draw the entire graph without lifting your pen which drawing all the edges exactly once, and visiting all the vertices, startin

Review from student

Studypool Student
" Excellent job "
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1831 tutors are online

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors