deterministic-finite-automata

There are 127 repositories under deterministic-finite-automata topic.

  • Gurpartap/statemachine-go

    🚦 Declarative Finite-State Machines in Go

    Language:Go1007119
  • whitemech/pythomata

    A Python package for automata theory.

    Language:Python542236
  • vinyasns/dfa-to-regex

    A Python implementation to convert a Deterministic Finite Automata to Regular Expression using state elimination method

    Language:Python20315
  • amirkabiri/finite-automata

    Graphical interface for designing finite automata

    Language:JavaScript19233
  • Dentrax/Finite-State-Machine

    Finite State Machine Library for .NET Core (with EASY and ADVANCED implementation)

    Language:C#192016
  • lowlighter/cellular-automaton

    🧫 A complex cellular automaton which simulates an entire ecosystem : universe, flora and fauna.

    Language:JavaScript11105
  • ehwan/RustyLR

    GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action

    Language:Rust10300
  • subttle/regular

    Finite Automata and Regular Expressions for Regular Languages in Haskell

    Language:Haskell102141
  • kvrigor/dfa2cfg

    Naive GUI app for generating the context-free grammar (CFG) from an input deterministic finite automaton (DFA).

    Language:C#7452
  • arjkashyap/DFA-simulator

    A tool for testing and simulating Deterministic Finite Machines with string inputs

    Language:JavaScript6200
  • lucaslise/reCreator

    Uma ferramenta para criar e validar Expressões Regulares

    Language:JavaScript6200
  • LexicalAnalyser

    MERZAK-X/LexicalAnalyser

    Lexical Analyser is a Lexer / Tokenizer that determines whether a source code is accepted by a given Deterministic Finite State Automaton or not.

    Language:C#63110
  • theumairtahir/CipherCompilerLexicalAnalyzer

    Semester project, the lexical analyzer for a custom compiler. Deterministic Finite Automaton is Implemented in this project.

    Language:C#5101
  • AndreMacielSousa/UAbALL

    The "Automata Learning Lab da Universidade Aberta (UAbALL)" strives to be an integrated laboratory for simulation of Automata. A first phase focused on building the base and introducing the Simulation of Deterministic Finite Automata (DFA). This Laboratory intends to enjoy the capacity of extensibility and adaptability, being this document a technical and scientific basis for the future production of the remaining components, as well as adapted to new technological realities and distribution platforms.

    Language:JavaScript4100
  • drknzz/Deterministic-Finite-Automata

    🔄 Deterministic Finite Automata simulator 🔄

    Language:Prolog4200
  • jaxcksn/FSMD

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

    Language:Python4201
  • KarmaKamikaze/GeneticDFA

    The GeneticDFA project uses genetic programming to reverse engineer blackbox systems modeled in DFA form.

    Language:C#43200
  • AmineAgrane/finite-state-automaton-library

    The aim of this project is to design and implement a library allowing to generate and represent finite state machine also know as finite automaton. The library will also implement algorithms to perform operations that are specific to finite state automaton : Determination, Minimization, Complementary, Elimination of ***ε*** transitions, etc

    Language:Java3101
  • AniKar/DFALang

    An interpreter of a compact language for working with Deterministic Finite Automata.

    Language:Python3200
  • dankolesnikov/DFAtoTuringMachine

    Turing Machine that simulates behavior of any Deterministic Finite Automata

  • eraldoforgoli/NFAtoDFAConverter

    Theory of Computation | Conversion from NFA to DFA

    Language:Java3101
  • EstellaPaula/RegexEngine-ANTLR-parser

    A parser for regex expressions, converting them to equivalent ER (regular expressions), then to corresponding Nondeterministic & Deterministic Finite-State Machine (NFA & DFA) built for checking validity of given strings.

    Language:Python3202
  • felixklauke/winchester

    Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.

    Language:C++331
  • LeandroMartinMacato/Automata_Project

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

    Language:Python3100
  • Salpadding/regexp

    regular expression engine based on deterministic finite automata(DFA)

    Language:Go3200
  • slemonide/genetic_programming_ant

    Genetic programming algorithm for automating ant motion

    Language:Lua3200
  • alphinaud11/Compiler

    An implementation of multiple concepts and techniques related to the theory of computation and compilers like DFA, NFA, Regular Expressions, Fallback DFA, CFG Left-Recursion Elimination, First and Follow, LL(1) Parsing, Lexical Analysis, and SDD

    Language:Java2202
  • artisan1218/Turing-Machine

    Java implementation of DFA(Deterministic Finite Automata) and Turing Machine

    Language:Java2101
  • cgiff9/tmfuck

    A simple free-form interpreted language for building Turing machines and other automata

    Language:C2100
  • FooKaiWen/Conjuction-Finder-DFA

    Web application that utilizes Deterministic Finite Automata as a conjunction finder and find patterns

    Language:Python2200
  • gridhead/re2fa-converter

    A Qt 5 Python GUI application for converting regular expressions to a finite automaton

    Language:Python2161
  • mehanix/DFA-NFA-Acceptor

    🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.

    Language:C++230
  • SH-anonta/DFA-Diagramming-Tool

    NFA, DFA simulator with Angular 5 and Easeljs

    Language:TypeScript2100
  • ShrohanMohapatra/PackMFCS

    A set of python programs that can be used by early learners of the Mathematical Foundations of Computer Sciences (courtesy: Introduction to the Theory of Computation by Michael Sipser)

    Language:Python2200
  • zezax/one

    This is the "one": Linuxy infrastructureish mostly C++ code.

    Language:C++2740