Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular

Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)

Theory of Machines and Languages Project

AUT Formal Languages and Automata course programming assignment

A simple script to convert Python regular expression to expressions following the formal defintion

Implementation of finite-state machines and exportation to dot format

Regex -> ε-NFA -> DFA -> minDFA, lexical analysis

Lambda-NFA to DFA real-time visualizer

Finite automata (DFA and NFA) with functionality to convert NFAs to DFAs and check string acceptance.

A python program which converts NFA to DFA

Theories of Machines and Languages Project - Spring 2022

My codes for assignments for Automata Theory Course Spring 2021

Codes to convert Regex-to-NFA, NFA-to-DFA, DFA -to-Regex, minimizing DFA.

All CC-Labs of Sir Nadeem.

Conversion from Non-Deterministic Finite automata (NFA) to Deterministic Finite automata (DFA)

A CLI program that converts an input Non-Deterministic Finite Automaton into a Deterministic Finite Automaton.

This is an Assignment for the CS201 course.

This is final project of Theory-of-Machines-and-Languages

Midterm project of Theory of languages and automata - Mentorship