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.
44. Exercise 36
The finite-state automaton to return the words that start with a consonant and contains exactly two consecutive vowels.
The first letter of the word should not be a vowel and if there is a vowel in the word the next letter also should be a vowel (exactly two vowels)
Let be a set such that and be a set such that .
Now we can define a , the set of inputs as .
Let the initial state be . For the input , does not response. Hence, automaton keeps its state on because the first letter should be a consonant.
When we input to the initial state, is satisfied and move onto the next state such that is the state, the first letter is selected
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started