Illustration DFA - word length less than or equal to 2

Download

Share — copy and redistribute the material in any medium or format

Adapt — remix, transform, and build upon the material for any purpose, even commercially.

Sharing and adapting of the illustration is allowed with indication of the link to the illustration.

Sketch of a deterministic finite automaton (DFA) for the following regular language (type 3):$$ L ~=~ \{ w \in \{a,b\}^* ~:~ |w| \leq 2 \} $$

This is a finite language with words \(w\) whose word length \(|w|\) is less than or equal to 2:$$ L ~=~ \{\varepsilon, a, b, ab, ba, aa, bb \} $$

Give feedback

Hey! I am Alexander, the physicist and author here. It's important to me that you are satisfied when you come here to get your questions answered and problems solved. But since I don't have a crystal ball, I depend on your feedback. That way I can eliminate mistakes and improve this content so that other visitors can benefit from your feedback.

How satisfied are you?

Very nice!

If there is anything you would like to see improved, please send me a message below. I would be very happy if you support the project.

Hmm...

Would you mind telling me what you were missing? Or what you didn't like? I take every feedback to heart and will adapt and improve the content.

What's the trouble?

Do not be disappointed, I can certainly help you. Just send me a message what you actually wanted to find here or what you don't like. I really take your feedback seriously and will revise this content. If you are very disappointed, explain your concern in the feedback and leave your email and I will try to help you personally.