Draw a nondeterministic finite automaton (NFA) that recognizes the language of strings of lowercase alphabetic characters which don't violate the rule "'i' before 'e' except (directly) after 'c'." The alphabet should be just the letters 'c', 'e', 'i', and 'x', where 'x' will stand for all lowercase letters other that 'c', 'e', and 'i.' Use JFLAP and submit the saved file.
Draw a nondeterministic finite automaton (NFA) that recognizes the language of strings of lowercase
alphabetic characters which don't violate the rule "'i' before 'e' except (directly) after 'c'." The
alphabet should be just the letters 'c', 'e', 'i', and 'x', where 'x' will stand for all lowercase letters other
that 'c', 'e', and 'i.' Use JFLAP and submit the saved file.
Consider the example :
- relief
- friend
- hygiene
- grief
where the rule 'i' before 'e' is satisfied and we need to consider the except case where the rule 'i' before 'e' except (directly) after 'c'.
''ei'' after ''c'':
- ceiling
- receive
- conceive
- deceit
So we need to design an NFA with the above examples that has to be satisfied.
The transition diagram of the NFA is:
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
