CS402 Theory of Automata Assignment 1 Solution Fall 2014

Q.1. Write a Regular Expression (RE) for the language of all strings defined over Σ = {x, y, z} which begins with z, x in the middle and ends with y. The minimum length of all strings must be 4.
[Marks 6]

Q.2.
a) Make a transition table for RE in Q.1.
b) Draw a Finite Automaton (FA) for part(a)
[Marks 7+7]

 

DOWNLOAD SOLUTION HERE
loading...