In each of 20—28, (a) design an automaton with the given input alphabet that accepts the given set of strings, and (b) find a regular expression that defines the language accepted by the automaton.

27. Input alphabet = { 0 ,   1 } ; Accepts the set of all strings that start with 0 and contain exactly one 1.

(a)

To design an automaton with the given input alphabet that accepts the given set of strings.

Given information:

Input alphabet ={0,1} ; Accepts the set of all strings that start with 0 and contain exactly one 1

Calculation:

Given:

Input alphabet ={0,1}

Accepts all strings that start with 0 and contain exactly one 1

Let us design an automaton with 4 states s0,s1,s2 and s3 where s0 is the initial state and s3 is the accepting state.

s0= Initial states1=Input starts with a 0s2= Input starts with a 1 or contains more than one 1s3= Input starts with a 0 and contains exactly one 1

When we are at state s0 and the input is a 0, then the input starts with a 0 and thus we need to move to state s₁

(b)

A regular expression that defines the language accepted by the automaton.