I couldn't write nfa or dfa for the language above. Please, help me!
The set of words in {a,b,c}∗ that do not contain the substring bc.
0
$\begingroup$
formal-grammar
-
2Please show what you have tried so far. – 2012-11-12
-
0Do you know a regular expression for that language? Because if you do, that makes the problem a bit easier. – 2012-11-12
-
0I don't know regular expression but probably, all the options are possible. This is the question. – 2012-11-12