A Python package for automata theory.

A repository containing all experiments for the course Compiler Design.

Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.

This repository contains various programs related to the theory of computation

Context free grammar to pushdown automaton convertor, along with string parser - Theory of Languages and Machines project, spring 2020

A tiny library which contains tools to convert, minimize and visualize Regular Expressions, NFA and DFA.

Implementation of PushDown Automata to track acceptance or rejection of a string.

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

北京邮电大学 2023-2024 春季学期《形式语言与自动机》课程实验——上下文无关文法（CFG）与下推自动机（PDA）

Utilities for the HOA format.

A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)

A python CLI tool for creating diagrams of finite state machines.

Automata Theory and Formal Languages algorithm for check them

Simulate a string if it is valid in the deterministic finite automaton (DFA)

this repository is your go-to resource for CFG(Context-free Grammar) to CNF(Chomsky Normal Form) conversion and the implementation of the CYK(Cocke-Younger-Kasami) algorithm for CFGs.

A PoC of making a regular expression parser from scratch in Python using Automata theory

common algorithms in automata theory - minimization algorithms, regex compilers etc.

A programmtic automata renderer and minimizer

the automata-lab project is a implements various automata, including DFA, NFA,DPDA.

Property Based Testing for Finite Automata and Context-free Grammars