A Python package for automata theory.

根据正则表达式生成其对应 DFA 的状态转移图

From a image containing the handwritten automaton, generating the latex code from it.

Program to make NFA from Regular Expression and make it to DFA then simplify it! Then parse a Pascal program.

Implementation of finite-state machines and exportation to dot format

北京邮电大学 2023-2024 春季学期《形式语言与自动机》课程实验——NFA 到 DFA 的转化

Transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states

A programmtic automata renderer and minimizer

eNFA - NFA, DFA - DFA minimization, CNF and CKY

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

First partial project carried out for the computational mathematics course.

This Python tool transforms NFAs to DFAs, minimizes DFAs, and converts regular expressions to NFAs.

Minimization and Visualization of a DFA Machine. This project was developed as part of a university assignment.

Midterm project of Theory of languages and automata - Mentorship

Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.

Introduction to automata theory, languages and computation

Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression

🔃 Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator 🔀

Projet CY-Tech