Crowdly
Add to Chrome
Considere a GR G = ({A,B,C},{0,1}, A, {A ® 1A|0B|1, B ® 0C|1B|0, C ® 0A|1B...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Considere a GR G = ({A,B,C},{0,1}, A, {A ® 1A|0B|1, B ® 0C|1B|0, C ® 0A|1B})
Qual dos seguintes autómatos finitos reconhece a linguagem L(G)?
M1 = ({A,B,C,D}, {0,1}, A, {D}, d1)
d1 | 0 | 1 |
A | {B} | {A,D} |
B | {C,D} | {B} |
C | {A} | {B} |
D | Æ | Æ |
M2 = ({A,B,C,D}, {0,1}, A, {D}, d2)
d2 | 0 | 1 |
A | {B} | {A} |
B | {C} | {B} |
C | {A} | {B} |
D | Æ | Æ |
M3 = ({A,B,C,D}, {0,1}, A, {D}, d3)
d3 | 0 | 1 |
A | B | A |
B | C | B |
C | A | B |
D | Æ | Æ |
M4 = ({A,B,C}, {0,1}, A, {C}, d4)
d4 | 0 | 1 |
A | {B} | {A} |
B | {C} | {B} |
C | {A} | {B} |
❌
✅
❌
❌