A Python package for automata theory.

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

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

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

Implementation of finite-state machines and exportation to dot format

A Tool for Drawing the DFA/NFA of a Regex for a Regular Language

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

Midterm project of Theory of languages and automata - Mentorship

A programmtic automata renderer and minimizer

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

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

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

First partial project carried out for the computational mathematics course.

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

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

Introduction to automata theory, languages and computation

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

Projet CY-Tech

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

A structured archive that contains all assignments and related materials from the "Formal Languages and Automata" course, organized for easy and efficient access.