Detect useless transitions in Pushdown Automata
-
Updated
Feb 21, 2017 - C++
Detect useless transitions in Pushdown Automata
A python program that helps convert NFAs to DFAs. (Uses networkx)
Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.
Experiment to test multiple words into nondeterministic finite automatas.
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
Classes to simulate various automatas in Formal Language Theory
Implementation Of finite State Machines In JAVA
This is a lex program to simulate NFA/ DFA
Converts a given epsilon-NFA to NFA to DFA
This repository contains all of my codes of Compiler Lab
Simple interpreter for PDA programs (Language for designing and testing pushdown automatas)
Theory of Computation | Conversion from NFA to DFA
regular expression engine based on deterministic finite automata(DFA)
Implementation of Finite Automata(deterministic , non-deterministic and non-deterministic with ε transitions)
[PORTUGUÊS] Trabalho de Linguagens Formais e Autômatos para a faculdade
Graphical interface for designing finite automata
A Qt 5 Python GUI application for converting regular expressions to a finite automaton
Parses a given string through a provided non-deterministic finite automaton
Add a description, image, and links to the non-deterministic-finite-automaton topic page so that developers can more easily learn about it.
To associate your repository with the non-deterministic-finite-automaton topic, visit your repo's landing page and select "manage topics."