This project provides a C implementation for converting a Nondeterministic Finite Automaton (AFN) into a Deterministic Finite Automaton (AFD).
-
Updated
May 16, 2024 - C
This project provides a C implementation for converting a Nondeterministic Finite Automaton (AFN) into a Deterministic Finite Automaton (AFD).
Prácticas relacionadas a la teoría del lenguaje, gramáticas, AFD, AFN y una máquina de Turing que realiza una suma de 2 números binarios en lenguaje C.
Add a description, image, and links to the afn topic page so that developers can more easily learn about it.
To associate your repository with the afn topic, visit your repo's landing page and select "manage topics."