A Python package for automata theory.

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

A repository containing all experiments for the course Compiler Design.

This repository contains various programs related to the theory of computation

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

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

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

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

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

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

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 deep dive into Formal Methods in Software Engineering 📜—exploring automata, logic, verification, and specification techniques to ensure software correctness and reliability.

Automata Theory and Formal Languages algorithm for check them

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

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

A programmtic automata renderer and minimizer

FSA to RegExp Translator

Bowling game kata implementing finite state machine or automata

🎏 Conversor capaz de traduzir Autômatos Finitos Não Determinísticos em Autômatos Finitos Determinísticos. Projeto desenvolvido utilizando PyQt e JsonSchema, compatível com formatos JFLAP.