CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #6 Fall
2006
Chapter 2 in The New Turing Omnibus – Finite Automata
Assignment: A. Use figure 2.2 and show with it that:
1) 0101 and
2) 0100101
are words in the language of this FA while
3) 0110 and
4) 010010
are not words in the language
B. Describe a FA by creating its automata(state transition
diagram) for
1) 0101*
2) 10* + 010*1*
3) (01)* (0+1)
Please word process parts A and B using nice graphics. Assignment is worth
20 points.
CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #6 Fall
2006
Chapter 2 in The New Turing Omnibus – Finite Automata
Assignment: A. Use figure 2.2 and show with it that:
1) 0101 and
2) 0100101
are words in the language of this FA while
3) 0110 and
4) 010010
are not words in the language
B. Describe a FA by creating its automata(state transition
diagram) for
1) 0101*
2) 10* + 010*1*
