Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata

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.

RegEx Wizard

Calculator created by implementing pushdown automata

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

01076121 THEORY OF COMPUTATION

Image Recognition using Finite and Pushdown Automata

A Pushdown Automata that parses regular expressions

A web-based graphical simulator for Finite automata, Pushdown automata and Turing machines.

Python command line interface finite automaton reader (Up to pushdown automata).

Finite & Pushdown Automata, Regular Grammar

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

A simple free-form interpreted language for building Turing machines and other automata

Introduction to automata theory, languages and computation

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

👨🏽‍💻👏 Assignment for 'Formal Languages, Automata and Computability' subject about a simulation of Pushdown Automata

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

Fundamental computing machines implemented in Clojure.

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