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

Automata utility package for FSMs, PDAs, TMs in JS/TS.

Implementation of PushDown Automata to track acceptance or rejection of a string.

Unity FSM to control flow, menus, game objects and behaviours.

Convert PDA (Pushdown automata) to CFG (Context-free grammar)

Fundamental computing machines implemented in Clojure.

This is a deterministic pushdown automata project for my Theory of Computation course.

Bioinformatics Data Structures & Algorithms [such as the Q-Gram Index, scoring alignments , rna-structure prediction, generating the BLAST-Ńeighborhood and more.]

Introduction to automata theory, languages and computation

👨🏽‍💻👏 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.

In this Repo you can find CheatSeat for Theory of Computation and last minutes notes for your semester.

Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata

01076121 THEORY OF COMPUTATION

Build DFAs, NFAs, PDAs, and Turing Machines using text files

Calculator created by implementing pushdown automata

Definitions of necessary classes for working with contex-free grammars & an implementation of a few algorithms on them.

Кода на записките ми за упражнения по "Езици, автомати и изчислимост"