a repository for my curriculum project

Python implementation of a Deterministic Finite Automaton (DFA) with interactive testing. Verify input string acceptance and explore language processing concepts

Mathematical foundations of computing---A full course on Automata Theory, Computation, Complexity and NP-hardness

REGEX-NFA converter and NFA simulator

Conway's Game of Life on Godot Engine. The game is visualized on a square and on a torus.

This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)

Java program designed to create NFA, DFA and context free grammars, allowing to perform lexical and syntactic analysis.

Universal Turing Machine in Java

This repository contains three C language programs: monolithic, iterative and recursive, each calculating the Fibonacci sequence. I used the Trace Machine method to identify strong equivalence between the programs. The source code and presentation used in the classroom are available here.

Presentation for http://wrap.warwick.ac.uk/141321/1/WRAP-The-big-O-problem-labelled-markov-chains-weighted-automata-Purser-2020.pdf

Python script to create and test Turring machines

Simulators for Finite Automaton, Pushdown Automaton, and Turing Machine. Explore computational theory interactively!

Computational Theory countdown game

Turing machine emulator

A Python-based solver for the Countdown Numbers Game, featuring algorithms to analyze and solve the numbers round from the popular TV show. This project includes Jupyter notebooks demonstrating the application of computational theories and algorithm complexities to reach or approximate the target numbers using given constraints