✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Considere o AFDM = ({A,B,C,D}, {a,b}, A, {A,C}, δ)
δ | a | b |
A | A | B |
B | B | C |
C | C | D |
D | C | B |
Qual das seguintes tabelas está completamente preenchida na determinação de estados indistinguiveis?
T1:
B | 1 |
|
|
C | 3 | 1 |
|
D | 1 | 2 | 1 |
| A | B | C |
T2:
B | 1 |
|
|
C | 1 |
| |
D | 1 | 1 | |
| A | B | C |
T3:
B | 1 |
|
|
C | 1 |
| |
D | 1 | 2 | 1 |
| A | B | C |
T4:
B | 1 |
|
|
C | 1 | 1 |
|
D | 1 | 1 | |
| A | B | C |