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.
20. Input alphabet
(a)
To design an automaton with the given input alphabet that accepts the given set of strings.
Given information:
Input alphabet
Calculation:
Given:
Input alphabet
Accepts all strings for which the final three input symbols are 1.
Let us design an automaton with 4 states
When we are at state
(b)
A regular expression that defines the language accepted by the automaton.