Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata
-
Updated
Oct 23, 2022 - Python
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 v5.0
Definitions of necessary classes for working with contex-free grammars & an implementation of a few algorithms on them.
01076121 THEORY OF COMPUTATION
Calculator created by implementing pushdown automata
Python command line interface finite automaton reader (Up to pushdown automata).
Image Recognition using Finite and Pushdown Automata
A Pushdown Automata that parses regular expressions
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 interpreted language for building Turing machines and other automata
👨🏽💻👏 Assignment for 'Formal Languages, Automata and Computability' subject about a simulation of Pushdown Automata
Introduction to automata theory, languages and computation
Материалите ми за упражнения по "Езици, автомати и изчислимост"
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)
Unity FSM to control flow, menus, game objects and behaviours.
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."