Simulador de Autómatas Finitos Deterministas (AFD) y Autómatas Finitos No Deterministas (AFND)

Implementation of a pushdown automaton (PDA) in Java for learning purposes

An automata simulator, converts a regular expression to a Finite Deterministic Automata.

Learning how to simulate a grammer in a Non Deterministic Finite Automata

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

un TP pour la simulation des automates à états finis déterministes

The application is developed in Java, converts any given Regular Expression to Minimised DFA. It follows the path: RE-->NFA-->DFA-->Minimised DFA.

A senior honors thesis developing a Java graphical application for computational automata.

Repository for (simple) finite automata designs.

An automata simulator written in Java, supporting Moore, Mealy, TM, DFA, NFA, DPDA, NPDA, CFG

A simple tool to convert NDFA(Non-deterministic Finite Automaton)(without Lambda(or Epilson) Transitions) into DFA(Deterministic Finite Automaton), both using JFLAP's simulator file format.

A project for my study of NFA and its application.

Automata Simulator: DFA & NFA

Bagulho de simulacao

a Java program to run deterministic finite-state automatons

A simple Java program to run non-deterministic final state automata (NFAs).

Basic Automata Implementation Java