CS381 Homework Assignment number 4 Due Friday, September 23 Please write your name and net id on the upper right corner of each page. 1. (a) Construct all 0ijR, 1ijR, and 2ijRfor the finite automaton defined in the table below. Simplify each kijRas you go along. It may help if you draw the state diagram for the automaton and check each kijRto make sure that it is correct as you go. Note you are not asked to construct any 3ijRfor this part. (b) What is the regular expression denoting the set accepted by the finite automaton? Assume that state 1 is the start state and that state 3 is the only final state.
This is the end of the preview.
access the rest of the document.
Exponentiation, Natural number, Nondeterministic finite state machine, Let Kunovice, rij, 0100100001000001L