5. In general, an automata consists of Input file, the automata consists of current state. configuration is uniquely determined, the automata is called uniquely determined, the automata is called it is called as accepter; when it can produce Storage, and Output. A current configuration in and storage. When the move from one configuration to next automata. When the move are not automata. When the output is limited to it is called as transducer.

II. Pushdown Automata. Draw a PDA that recognizes the following languages. All machines should be deterministic (each transition from each state has a unique transition symbol), non-deterministic machines will not be considered: b. L = {w & a³n^m' | s is >= n, and n is >= r, and r >0} General Instructions: No initial state, missing transitions, or transition symbols for a machine means that the machine will be marked as incorrect.

2. Consider the following hierarchical state machine: input: a: pure output: b: pure a/b a/b D a/b -1- HB a/b a/ F Construct an equivalent flat FSM giving the semantics of the hierarchy. Describe in words the input/output behavior of this machine. Is there a simpler machine that exhibits the same behavior?

QUESTION 1 1. Finite Automata Let us consider the following -NFA defined over the alphabet = {0,1}. F- 0,1 €,0 0,1 start → A B 1. Transform the automaton into an NFA, that is remove the transitions. Show, and com- ment on, all the steps. Show the resulting transition function (as a table) and also the diagram of the resulting automaton. 2. Transform the resulting NFA into a DFA. Show, and comment on, all the steps. Show the resulting transition function (as a table) and also the diagram of the resulting automaton. 3. Minimise, if possible, the resulting DFA by applying the method of partitions. Show, and comment on, all the steps. Show the resulting transition function (as a table) and also the diagram of the resulting automaton. 4. Apply the appropriate algorithm to verify that the DFA before and after minimisation are equivalent. 5. Determine for the most minimal DFA available the language that this automaton accepts by finding its regular expression. Manipulate the found regex to…