Lecture 3 - Graphs and Intro to Finite Automata Flashcards
What is an undirected graph?
It is a set of points with lines connecting some of the points. The points are nodes and the lines are edges
What is the degree of a node?
This is the number of edges at the node
What is a path?
A path is a sequence of nodes connected by edges
What is a connected graph?
A graph is connected if every 2 nodes have a path between them
What is a cycle?
A cycle is a path that starts and ends at the same node.
What is a simple cycle?
A simple cycle is a cycle that contains at least 3 nodes and repeats only the first and last node
What is a directed graph?
A directed graph is one that has arrows instead of lines
What is the outdegree?
An outdegree is the number of arrows pointing from a single node.
What is the indegree?
The indegree is the number of arrows pointing to a node.
Define a finite automata
It is a 5 tuple (Q, ∑, ᶁ, qo, F). Q is the states ∑ is the alphabet ᶁ is the transition function qo is the start states F is the accept states
