Give the DFA for language of strings over ∑= {a, b} where no two consecutive a’s occurred.
Mathbot Says...
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.
Give the DFA for language of strings over ∑= {a, b} where no two consecutive a’s occurred.
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.