Question

The Following Question belongs to Theory of Automata Make a DFA (Deterministic finite Automaton) for: •All...

The Following Question belongs to Theory of Automata

Make a DFA (Deterministic finite Automaton) for:

•All words that start with a double letter

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Sol. All words that Starts cuith a double letter. Regular Expression = (aa tbb)(a+b)* Start

Add a comment
Know the answer?
Add Answer to:
The Following Question belongs to Theory of Automata Make a DFA (Deterministic finite Automaton) for: •All...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT