A simple interpreted language for building Turing machines and other automata
-
Updated
May 19, 2024 - C
A simple interpreted language for building Turing machines and other automata
This project provides a C implementation for converting a Nondeterministic Finite Automaton (AFN) into a Deterministic Finite Automaton (AFD).
A generator of service-oriented applications for demonstration purposes that are based on Deterministic Finite Automata (abbreviated DFA).
This is the "one": Linuxy infrastructureish mostly C++ code.
Formal Languages and Automata Course (2020-2021)
Deterministic Finite Automata
This repository contains all the exercises done in the Theory of Computation course, addressing topics such as deterministic and nondeterministic finite automata, as well as grammar generation, along with an implementation of the Turing machine.
Please read the Design Report.
Projet CY-Tech
A Python package for automata theory.
Collected list of benchmarks for evaluating different approaches to reasoning about regular properties.
A python CLI tool for creating diagrams of finite state machines.
🚦 Declarative Finite-State Machines in Go
The Finite State Machine (FSM) Interactive Learning Website is a modern and user-friendly online platform designed to assist Computer Science students in comprehending the fundamental concepts of Finite State Machines.
formal_language_theory_midterm_project_spring_1402
Python command line interface finite automaton reader (Up to pushdown automata).
The GeneticDFA project uses genetic programming to reverse engineer blackbox systems modeled in DFA form.
Analizador léxico para automatas finitos deterministas, automatas de pila, gramáticas regulares y gramáticas tipo 2. Proyecto basado en Consola Python.
Add a description, image, and links to the deterministic-finite-automata topic page so that developers can more easily learn about it.
To associate your repository with the deterministic-finite-automata topic, visit your repo's landing page and select "manage topics."