In 29—47, design a finite-state automaton to accept the language defined by the regular expression in the referenced exercise from Section 12.1.

39. Exercise 31

Design a finite-state automaton to accept the language defined by the regular expression in the referenced exercise from Section 12.1.

Given information:

Language of regular expression is x*(yxxy|x*)

Concept used:

Arrow in the given graph played vital role in answer selection.

Calculation:

It is required to design an automaton that accepts language defined by a regular expression which is expressed in words as “All words that are written in lower-case letters and start with the letter pre but do not consist of pre all by itself”. A regular expression that represents the above statement is pre[a−z]+ .To construct a finite state automaton that accepts language defined by the given regular expression, it is required to define few variables.

Consider p' representing all the letters of lower case alphabet except p and r'

Representing all the letters of lower case alphabet except r and e' representing all the letters of lower case alphabet except e