Lecture 5 - Regular Languages and Non-deterministic Finite Automata

Question 1

What are the 3 regular operations?

Answer 1

1. Union
2. Concatenation
3. Star

Question 2

What is the union operation?

Answer 2

List every element of the sets

Question 3

What is the concatenation operation?

Answer 3

Each element from set B added on to the end of each element of set A

Question 4

What is the star operation?

Answer 4

It is every possible combination of a set possible

Question 5

What is a theorem?

Answer 5

It is a mathematical statement proved true

Question 6

What do NFAs provide?

Answer 6

A way to do parallel computation

Question 7

What are the differences between NFAs and DFAs?

Answer 7

1. DFAs always have exactly one exiting transition for each symbol.
   NFAs may have zero, one, or more than one exiting transition for each symbol.
2. NFAs can have a transition symbol for the blank symbol.