C program to read , simulate and convert nfa to dfa
-
Updated
Feb 14, 2021 - C
C program to read , simulate and convert nfa to dfa
A turing machine for both deterministic and nondeterministic way
Implementation of an Deterministic Finite Automaton (DFA) in C to tokenize expressions for a simple Calculator (Lexical Analyser).
This repository contains all of my codes of Compiler Lab
A simple interpreted language for building Turing machines and other automata
This project provides a C implementation for converting a Nondeterministic Finite Automaton (AFN) into a Deterministic Finite Automaton (AFD).
A library for simulating Deterministic Finite Automata written in C
DFA (Deterministic Finite Automata)
Add a description, image, and links to the deterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the deterministic-finite-automata topic, visit your repo's landing page and select "manage topics."