A Python package for automata theory.

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)

This repository contains an implementation of DISC, an algorithm for learning DFAs for multiclass sequence classification.

Projet CY-Tech

This model accepts regular language descriptions from users, converts them to DFAs, and minimizes the DFAs. The minimized DFAs are then visualized as images, aiding users in understanding language structures. Implemented in Python, graph visualization tools, and minimization algorithms.

A basic Python 3 project that scans a given word and returns if its valid or not based on a DFA defined by a text file

Projeto e implementação de uma classe que representa um Autômato Finito Determinístico. Trabalho realizado no 5º período de Ciência da Computação do Instituto Federal de Minas Gerais(IFMG) - Campus Formiga para a Disciplina Linguagens Formais e Autômatos.

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

A compiler for a made up language using a table-driven DFA lexer, predictive recursive descent parsing, and syntax directed translation to generate p-code for a virtual machine. The virtual machine is also included in this project.

Lexical Analyzer , Syntax Analyzer and Semantic Analyzer. using, DFA, FSA, cfgs, regular expressions , will implement different parsers e.g CLR0, LL1 , OPERATOR etc