<- previous index next ->
Open book. Open note, multiple choice in cs451q1.doc
Covers lectures and homework.
cp /afs/umbc.edu/users/s/q/squire/pub/download/cs451q1.doc . # your directory
libreoffice cs451q1.doc
or scp, winscp, to windows and use Microsoft word, winscp back to GL
save
exit
submit cs451 q1 cs451q1.doc
just view cs451q1.doc
See details on lectures, homework, automata and
formal languages using links below.
Open book so be sure you check on definitions and converting
from one definition (or abbreviation) to another.
Regular machine may be a DFA, NFA, NFA-epsilon
DFA deterministic finite automata
processes an input string (tape) and accepts or rejects
M = {Q, sigma, delta, q1, F}
Q set of states
sigma alphabet, list symbols 0,1 a,b,c etc
delta transition table
| 0 | 1 | etc
+----+----+
q1 | q2 | q3 | etc
+----+----+
q1 name of starting state
F list of names of final states
NFA nondeterministic finite automata
M = {Q, sigma, delta, q1, F}
delta transition table
| 0 | 1 | etc
+----+---------+
{q1,q3} | q2 | {q4,q5} | etc
+----+---------+
NFA nondeterministic finite automata with epsilon
M = {Q, sigma, delta, q1, F}
delta transition table
| 0 | 1 |epsilon| etc
+----+---------+-------+
{q1,q3} | q2 | {q4,q5} | q3 | etc
+----+---------+-------+
regular expression (defines strings accepted by DFA,NFA,NFA epsilon)
r1 = epsilon (computer input #e)
r2 = 0
r3 = ab
r4 = (a+b)c(a+b)
r5 = 1(0+1)*0(1*)0
regular language, a set of strings defined by a regular expression
from r1 {epsilon}
from r2 {0}
from r3 {ab}
from r4 {aca, acb, bca, bcb} finite
from r5 {epsilon,100,110110, ... } infinite
<- previous index next ->