A Python library for simulating finite automata, pushdown automata, and Turing machines
-
Updated
May 19, 2024 - Python
A Python library for simulating finite automata, pushdown automata, and Turing machines
C++14 Finite State Machine library
An Automata Learning Library Written in Python
Calculator created by implementing pushdown automata
Convert PDA (Pushdown automata) to CFG (Context-free grammar)
Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata
👨🏽💻👏 Assignment for 'Formal Languages, Automata and Computability' subject about a simulation of Pushdown Automata
A coursework submission focused on topics such as finite state automata, kleene's theorem, pushdown automata, regular languages and regular expressions, reading and writing CFG's including Chomsky Normal Form and BNF, Pumping Lemma for CFG's and RE's and Turing Machines.
This is a deterministic pushdown automata project for my Theory of Computation course.
Unity FSM to control flow, menus, game objects and behaviours.
Automata utility package for FSMs, PDAs, TMs in JS/TS.
Bioinformatics Data Structures & Algorithms [such as the Q-Gram Index, scoring alignments , rna-structure prediction, generating the BLAST-Ńeighborhood and more.]
Definitions of necessary classes for working with contex-free grammars & an implementation of a few algorithms on them.
Implementation of PushDown Automata to track acceptance or rejection of a string.
01076121 THEORY OF COMPUTATION
A simple interpreted language for building Turing machines and other automata
In this Repo you can find CheatSeat for Theory of Computation and last minutes notes for your semester.
RegEx Wizard v5.0
Python command line interface finite automaton reader (Up to pushdown automata).
Finite & Pushdown Automata, Regular Grammar
Add a description, image, and links to the pushdown-automata topic page so that developers can more easily learn about it.
To associate your repository with the pushdown-automata topic, visit your repo's landing page and select "manage topics."