# Conversión De Un Afnd A Afd- Diapos

• January 2021
• PDF

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form.

### More details

• Words: 186
• Pages: 14
CONVERSIÓN DE UN AFND A AFD

EJEMPLO:  Tenemos

el siguiente autómata finito no determinista: 0

1

0

B

D

0 0

A

0

1 1

0 C

1

E

Realizamos nuestra tabla de transacciones:  Para A con {0,1}

A

0

1

B,C

-

 Para

B con {0,1}

B

0

1

B,C

-

 Para

C con {0,1}

C

0

1

B

D,E

Realizamos nuestra tabla de transacciones:  Para D con {0,1}

D

0

1

B

D,E

Realizamos nuestra tabla de transacciones:  Para E con {0,1}

E

0

1

-

-

TABLA DE TRANSICION: 0

1

A

B,C

-

B

B,C

-

C

B

D,E

D

B

D,E

E

-

-

PROCEDIMIENTO PARA LA TRANSFORMACION 0

1

0

B

D

0 0

A

0

1 1

0 C

A

1

E

0

1

B,C

-

B,C

0

1

B,C

D,E

D,E

0

1

B

D,E

B

0

1

B,C

-

TABLA DE TRANSICION : 0

1

A

B,C

-

B,C

B,C

D,E

D,E

B

D,E

B

B,C

-

EJEMPLO:  Autómata

convertido: 1

0 1

0 A

B,C

0

D,E

0

B

January 2021 1
January 2021 2
January 2021 1
February 2021 1
January 2021 1
March 2021 0

January 2021 1
February 2021 1
January 2021 1
January 2021 0
January 2021 2
February 2021 1