✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Na determinação de estados indistinguíveis AFDM=({1,2,3,4,5,6}, {0,1}, 1, {1,2,3,4},d)
d | 0 | 1 |
1 | 2 | 3 |
2 | 4 | 3 |
3 | 2 | 3 |
4 | 4 | 5 |
5 | 4 | 6 |
6 | 6 | 6 |
obteve-se a seguinte tabela:
2 | 3 |
|
|
|
|
3 |
| 3 |
|
|
|
4 | 2 | 2 | 2 |
|
|
5 | 1 | 1 | 1 | 1 |
|
6 | 1 | 1 | 1 | 1 | 2 |
| 1 | 2 | 3 | 4 | 5 |
Qual dos seguintes AFDs reconhece a linguagem L(M)?
M1=({[1]≡,[2]≡,[5]≡,[6]≡},{0,1}, [1]≡, {[1]≡,[2]≡,[6]≡},d1)
d1 | 0 | 1 |
[1]≡ | [2]≡ | [1]≡ |
[2]≡ | [4]≡ | [1]≡ |
[5]≡ | [4]≡ | [6]≡ |
[6]≡ | [6]≡ | [6]≡ |
M2=({[1]≡,[2]≡,[5]≡,[6]≡},{0,1}, [1]≡, {[1]≡,[2]≡},d2)
d2 | 0 | 1 |
[1]≡ | [2]≡ | [1]≡ |
[2]≡ | [4]≡ | [1]≡ |
[5]≡ | [4]≡ | [6]≡ |
[6]≡ | [6]≡ | [6]≡ |
M3=({[1]≡,[2]≡,[4]≡,[5]≡,[6]≡},{0,1}, [1]≡, {[1]≡,[2]≡,[4]≡},d3)
d3 | 0 | 1 |
[1]≡ | [2]≡ | [1]≡ |
[2]≡ | [4]≡ | [1]≡ |
[4]≡ | [4]≡ | [5]≡ |
[5]≡ | [4]≡ | [6]≡ |
[6]≡ | [6]≡ | [6]≡ |
M4=({[1]≡,[2]≡,[4]≡,[5]≡,[6]≡},{0,1}, [1]≡, {[1]≡,[4]≡},d4)
d4 | 0 | 1 |
[1]≡ | [2]≡ | [1]≡ |
[2]≡ | [4]≡ | [1]≡ |
[4]≡ | [4]≡ | [5]≡ |
[5]≡ | [4]≡ | [6]≡ |
[6]≡ | [6]≡ | [6]≡ |