ps1 - as the state transition diagram. 3. Derive the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Problem Set 1: Regular expressions and Finite Automata 1. Give a non-deterministic finite automaton for the following regular expression: (( a * bc * ) | ( ab * c )) 2. Give a deterministic version of the finite automaton, using the construction we de- scribed in class. Provide both the graphical representation of the automaton as well
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: as the state transition diagram. 3. Derive the reduced DFA. Provide both the graphical representation of the automaton as well as the state transition diagram. 1...
View Full Document

Ask a homework question - tutors are online