Construct an automaton that recognizes the following language of strings over the alphabet {a,b}: {a,bb} that is only a and bb
Do anyone think that this might be the right approach or has any suggestion to somethin else.
Asked
Active
Viewed 170 times
0
-
Please be explicit in order to identify the accepting states (it seems that only the green one is) – Pedro Sánchez Terraf Feb 09 '15 at 13:23
-
There is a very similar example in Formally prove that every finite language is regular – MJD Feb 09 '15 at 18:46
1 Answers
1
Your NFA accepts only a language with a single word, namely $\{abb\}$. So you will need some branching in you automaton to fulfill your purpose.
Hint: Since the two words start differently, you need one branch for each.
Pedro Sánchez Terraf
- 4,854