<p>this forum is meant for research level questions. Your question seems to be an exercise to a first course on formal languages and would fit more in the following forum <a href="https://cs.stackexchange.com/">https://cs.stackexchange.com/</a></p>
<p>Concerning your automata, it is not correct as it refuses e.g. 122.</p>

CC BY-SA 4.0
2022-05-19T07:23:06.447Z
2022-05-19T07:23:06.447Z
Louis
<p>dfa over the alphabet Σ = { 0, 1, 2 } of strings that end with the same digit twice; e.g., strings that end in 00, 11, 22
Transition diagram for the corresponding language<a href="https://i.sstatic.net/h8ETO.jpg" rel="nofollow noreferrer"><img src="https://i.sstatic.net/h8ETO.jpg" alt="enter image description here" /></a></p>

CC BY-SA 4.0
2022-08-25T11:28:44.157Z
This looks more like an homework assignment in an undergraduate course than a research question?
J.y B.y
CC BY-SA 4.0
2022-08-25T06:50:00.557Z
2022-08-25T06:50:00.557Z
Phaneendra Reddy
<p>hi can you please go over my dfa for this and tell me if its correct??<a href="https://i.sstatic.net/3lShd.jpg" rel="nofollow noreferrer"><img src="https://i.sstatic.net/3lShd.jpg" alt="enter image description here" /></a></p>

<dfa>
I have to make a dfa over the alphabet Σ = { 0, 1, 2 } of strings that end with the same digit twice; e.g., strings that end in 00, 11, 22
Aniruddh
# I have to make a dfa over the alphabet Σ = { 0, 1, 2 } of strings that end with the same digit twice; e.g., strings that end in 00, 11, 22

(Asked by: username_0 on 2022-05-18)

hi can you please go over my dfa for this and tell me if its correct??[![enter image description here](https://i.sstatic.net/3lShd.jpg)](https://i.sstatic.net/3lShd.jpg)

**Tags:** dfa


---

## 2 answers

### Answer by username_1 on 2022-05-19. Score: 1

this forum is meant for research level questions. Your question seems to be an exercise to a first course on formal languages and would fit more in the following forum <https://cs.stackexchange.com/>

Concerning your automata, it is not correct as it refuses e.g. 122.


---

### Answer by username_2 on 2022-08-25. Score: 0

dfa over the alphabet Σ = { 0, 1, 2 } of strings that end with the same digit twice; e.g., strings that end in 00, 11, 22
Transition diagram for the corresponding language[![enter image description here](https://i.sstatic.net/h8ETO.jpg)](https://i.sstatic.net/h8ETO.jpg)

> **Comments:**
> **username_3**: This looks more like an homework assignment in an undergraduate course than a research question?  

---

