Assignment 2 for Computing Theory at UTS. The goal is to create a compiler that recognizes a simplified java syntax and outputs an abstract syntax tree. Made by Marcell, Tobias and Colin

An implementation of multiple concepts and techniques related to the theory of computation and compilers like DFA, NFA, Regular Expressions, Fallback DFA, CFG Left-Recursion Elimination, First and Follow, LL(1) Parsing, Lexical Analysis, and SDD

CFG to CNF in java by taking user inputs

Implemented Core Concepts Of Finite Automation in order To make Typing Game

Assignments and Exercises implemented during undergrad

Deterministic Finite Automaton that works recursively to do union, intersection and complement operations

Register-based machines (DNA and Multiset) written in Java which were used in the Theory of Computation's assignment.

Contains coursework for the Theory Of Computation course offered at Shiv Nadar University.

Implementação de Casamento de Strings com Autômatos Finitos em Java.

Simulating a DFA using Java.

This is a repository created to store the questions related to theory of Computation. This maynot be the most efficient way of solving the problem.

A simple Turing Machine simulator in Java.

Simple interpreter for PDA programs (Language for designing and testing pushdown automatas)

Assignments for the course CSD303 Theory Of Computation

A simple implementation of CYK algorithm to check the validity of a string according to the given grammer

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

Theory of Computation & Automata Theory algorithms and structures implementation

My naive computer based solutions to popular math hypothesis and problems, based on Mathematics for Computer Science course by MIT.