nfa

There are 306 repositories under nfa topic.

  • Regex2MDFA

    Input a Regex, get its AST, NFA, DFA and finally it Minimized DFA (Compiler Course Assignment)

    Language:Jupyter Notebook6

  • sfa-checker

    a little programm to check if a minecraft account is nfa or sfa

    Language:Python6

  • REGEX-TO-NFA

    A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.

    Language:JavaScript6

  • nfa-regex

    A regular expression engine based on nondeterministic finite automata (NFA)

    Language:Python6

  • compiler

    SEU CS Compiler Course Design: Python Implementation of LEX & YACC for Cminus

    Language:Python6

  • rltools

    regular language tools - automata-based tokenizer, LL(1) parser

    Language:Python6

  • states

    states is a utility for working with NFA, DFA and regular expressions

    Language:C++6

  • Regex2FA

    Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.

    Language:JavaScript5

  • TOC-Problem-Sets

    Solution of the problem sets of the course COL352- Introduction to Automata and Theory of Computation offered in Second (Holi) Semester 2021-22.

    Language:TeX5

  • statemachine-app

    Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!

    Language:CSS5

  • topylogic-git

    Topologic Python Library. A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well as which states the graph starts in.

    Language:C5

  • fsmdot

    Implementation of finite-state machines and exportation to dot format

    Language:Python5

  • tk-multi-startup

    A startup app for engines in Shotgun Toolkit.

    Language:Python5

  • Finite-Automata

    First assignment of theory of machines and languages course.

    Language:Python5

  • Automaton-Theory

    A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)

    Language:Python5

  • Thompsons-Construction-on-NFAs

    I was asked to write a Python program to execute regular expressions on strings using an algorithm known as Thompson's construction. In this, I have to build a non-deterministic finite automaton (NFA) from a regular expression, and can use this to check if the regular expression matches any given string text

    Language:Python5

  • E-NFA-to-DFA-Converter

    The Python script uses to convert the E-NFA to DFA and show the result in the web browser

    Language:Python5

  • Simple-Compiler

    Program to make NFA from Regular Expression and make it to DFA then simplify it! Then parse a Pascal program.

    Language:Python5

  • nfa-to-dfa

    Convert NFA to DFA (json output) from (json input, .nfa file)

    Language:JavaScript5

  • regular-languages-simulator

    A Regular Languages Simulator to help CS students understand and experiment with everything Regular Languages 📕 Includes Regular Expressions (Regexes), DFAs, NFAs, as well as functionality and UI for converting back and forth between them ♻️

    Language:TypeScript4

  • Compiler-Construction-with-Python

    Lexical Analyzer , Syntax Analyzer and Semantic Analyzer. using, DFA, FSA, cfgs, regular expressions , will implement different parsers e.g CLR0, LL1 , OPERATOR etc

    Language:Python4

  • statemachine

    Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!

    Language:CSS4

  • par-gen

    Fast JavaScript/TypeScript LR(1) parser generator

    Language:TypeScript4

  • DFA-Machine-Toolbox

    A little toolbox that provides detector and converter for DFA machines

    Language:Java4

  • baggage-handling-system

    Biçimsel Diller ve Otomata dersi dönem projesi.

    Language:C#4

  • Companion_PKMC

    TweakScale Companion Patches for Near Future Add'Ons

    Language:C#4

  • Compiler-Generator

    Built a compiler generator tool which can be supplied with lexical and grammar rules of any programming language and used to generate the lexical and syntax analyzer needed to generate intermediate code.

    Language:C++4

  • regex-matching-nfa

    Regular Expression Engine which Uses NFAs and DFAs to Match Regular Expression

    Language:C++4

  • RegextoNFA

    Converting Regular Expressions to Non-deterministic Finite Automaton(NFA) using C++ and displaying the NFA using OpenGL

    Language:C++4

  • regexbench

    Regex libraries benchmark

    Language:Java4

  • StateMachineApp

    State Machine App is a web app for automata enthusiasts, offering seamless conversion of Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) alongside advanced algorithms for DFA minimization and reduction. With its intuitive interface, powerful features,and simplify complex automata tasks, making it a better application.

    Language:CSS3

  • Simulation_of_Automata

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

    Language:Java3

  • spot

    Monorepo containing the spot text editor, an implementation of the m4 macro processor, and the Tornado Dodge console video game

    Language:C3

  • NFA-to-DFA-JS

    NFA to DFA Convertor written with JS

    Language:JavaScript3

  • PRINCIPLES-OF-COMPILER-DESIGN

    Principles of Compiler Design Programs

    Language:C++3

  • AutomaPy

    This package refers to the topic of automata theory, which includes DFA, NDFA, Mealy machines, Moore machines, Finite state machine and Turing machine.

    Language:Python3