# TOC | Designing Deterministic Finite Automata (Set 10)

**Prerequisite:** Designing finite automata

In this article, we will see some designing of Deterministic Finite Automata (DFA).

**Problem-1:** Construction of a minimal DFA accepting set of strings over {a} in which {a^{n} | n≥0, n≠2 i.e, ‘n’ should be greater than 0 and not equal to 2}.

**Explanation:** The desired language will be like:

L1 = {ε, a, aaa, aaaa, aaaaa, ..................}

Here ε is taken as string because value of ‘n’ is greater than or equal to zero and rest of the strings are having ‘a’ to the power of any positive natural number but not 2.

Below language is not accepted by this DFA because some of the string containing ‘a’ to the power 2.

L2 = {aa, aaaaa, ..........}

This language L2 is not accepted by this required DFA because of its string containing ‘a’ to the power of 2.

The state transition diagram of the desired language will be like below:

In the above DFA, the initial and final state’W’ on getting ‘a’ as the input it transits to a final state ‘X’. The final state ‘X’ on getting ‘a’ as the input it transits to a state ‘Y’. The state ‘Y’ on getting ‘a’ as the input it transits to a final state ‘Z’ which on getting any number of ‘a’ it remains in the state of itself.

**Problem-2:** Construction of a minimal DFA accepting set of strings over {a} in which {a^{n} | n≥0, n≠3, n≠4 i.e, ‘n’ should be greater than 0 and not equal to 2 and 4}.

**Explanation:** The desired language will be like:

L1 = {ε, a, aa, aaaaa, aaaaaa, .................. }

Here ε is taken as string because value of ‘n’ is greater than or equal to zero and rest of the strings are having ‘a’ to the power of any positive natural number but not 2 and 4.

Below language is not accepted by this DFA because some of the string containing ‘a’ to the power of 2 and 4.

L2 = {aa, aaaaa, aaaaaaaaaa, ............. }

The state transition diagram of the desired language will be like below:

In the above DFA, the initial and final state ‘A’ on getting ‘a’ as the input it transits to a final state ‘B’. The final state ‘B’ on getting ‘a’ as the input it transits to a state ‘C’. The state ‘C’ on getting ‘a’ as the input it transits to a final state ‘D’. The final state ‘D’ on getting ‘a’ as the input it transits to a state ‘E’. The state ‘E’ on getting ‘a’ as the input it transits to a final state ‘F’. The final state ‘F’ on getting ‘a’ as the input it remains in the state of itself.

## Recommended Posts:

- TOC | Designing Non-Deterministic Finite Automata (Set 4)
- TOC | Designing Non-Deterministic Finite Automata (Set 5)
- TOC | Designing Deterministic Finite Automata (Set 8)
- TOC | Designing Non-Deterministic Finite Automata (Set 1)
- TOC | Designing Deterministic Finite Automata (Set 6)
- TOC | Designing Deterministic Finite Automata (Set 7)
- TOC | Designing Deterministic Finite Automata (Set 11)
- TOC | Designing Deterministic Finite Automata (Set 9)
- TOC | Designing Deterministic Finite Automata (Set 2)
- TOC | Designing Deterministic Finite Automata (Set 1)
- TOC | Designing Non-Deterministic Finite Automata (Set 3)
- TOC | Designing Deterministic Finite Automata (Set 5)
- TOC | Designing Deterministic Finite Automata (Set 4)
- TOC | Designing Deterministic Finite Automata (Set 3)
- TOC | Designing Finite Automata from Regular Expression (Set 6)

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.