non-deterministic-finite-automaton
There are 37 repositories under non-deterministic-finite-automaton topic.
adrielcafe/hal
🔴 A non-deterministic finite-state machine for Android & JVM that won't let you down
amirkabiri/finite-automata
Graphical interface for designing finite automata
ehwan/RustyLR
GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action
subttle/regular
Finite Automata and Regular Expressions for Regular Languages in Haskell
ZigRazor/CXXAutomata
A C++ library for simulating automata and Turing machines
jaxcksn/FSMD
A python CLI tool for creating diagrams of finite state machines.
eraldoforgoli/NFAtoDFAConverter
Theory of Computation | Conversion from NFA to DFA
Salpadding/regexp
regular expression engine based on deterministic finite automata(DFA)
bernardkllogjri/FiniteAutomataConverter
Converts a given epsilon-NFA to NFA to DFA
gridhead/re2fa-converter
A Qt 5 Python GUI application for converting regular expressions to a finite automaton
theritik01/RE_to_NFA
This is a simple single page web-application calculator to demonstrate Search the word in the given text document by the use of NFA and conversion from Regular Expression to Non-deterministic automata (NFA) using source libraries such as React.JS, Node.JS and Express.JS etc..
angeligareta/finite-automaton-comparator
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
CoGian/FiniteAutomata
Implementation of Finite Automata(deterministic , non-deterministic and non-deterministic with ε transitions)
delledev/Simple-Regex-Engine
This TypeScript project is a concise Regular Expression Compiler, providing efficient tokenization, AST generation, and NFA compilation for streamlined handling of regular expressions.
ghost1412/DFA-NFA-simulator
This is a lex program to simulate NFA/ DFA
JSamuelAP/convertidor-er-a-afn
Aplicación de consola que convierte Expresiones Regulares a Autómatas Finitos No Deterministas
marinaRupe/FER.ITCS
Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.
Nihilish/PDARun
Simple interpreter for PDA programs (Language for designing and testing pushdown automatas)
paulorobertocruz/formais-2016-2
Trabalhos da matéria na UFT
rajaupadhyay/NFAtoDFA
A python program that helps convert NFAs to DFAs. (Uses networkx)
SwatBros/URI-Parser
Exam Project for the course "Programming Languages": implementation of an URL parser in Prolog and Lisp.
vishal1565/Compiler
This repository contains all of my codes of Compiler Lab
christinapap13/N2D-NFA-to-DFA-Converter
Diploma Thesis - CEID University of Patras. Application name: N2D: NFA to DFA Converter
FerrenF/dfaReader
Python command line interface finite automaton reader (Up to pushdown automata).
OpenWeavers/automata_utils
Classes to simulate various automatas in Formal Language Theory
RaffaeleTranfaglia/NDFA-Converter
Tool for converting a non deterministic finite automaton to a deterministic one.
scrocchi/NFAnalyzer
Experiment to test multiple words into nondeterministic finite automatas.
adhamhshm/nfa-to-rg-generator
NFA (Non-Deterministic Finite Automata) to RG (Regular Grammar) generator for TIC2151 Theory of Computation assignment.
AhsanKhaan/AutomataAssignments
Implementation Of finite State Machines In JAVA
Ashwin-1709/lexer
Regex to NFA and simulation of lex tool
danitrod/AFnD
[PORTUGUÊS] Trabalho de Linguagens Formais e Autômatos para a faculdade
gridhead/nfa-string-parser
Parses a given string through a provided non-deterministic finite automaton
hairullana/text-search-nfa
Document Text Search Using Non-deterministic Finite Automata
VeriFIT/automata-bench
Collected list of benchmarks for evaluating different approaches to reasoning about regular properties.