For my exercise Im supposed to create two DFA’s. Im sorry beforehand if the question is dumb, Im still learning.
The task specifically is:
Construct a DFA over the alphabet Σ={1,0} accepting the following regular languages.
a) An arbitrary long sequence of zeros and ones that ends with a zero followed by a zero or a one.
b) An arbitrary long sequence of zeros and ones that starts with a zero and ends with a one.
These are my DFA’s:
a)
b)
They are nearly the same (except the accepting states) and I wanted to know if they are correct? Maybe Im missing something?
I tried to draw two DFA’s. They seem to accept the languages but I think also some more… is that avoidable? Or still correct?
Auxelia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.