A Figma like Editor to Design Custom Finite State Machines

Informatica teorica

Particle System Demo developed as the final project of theory of computation course at Shahid Beheshti University on spring 2022

fava: Functional Programming Language on Scala

My practices and implementation during my studies on computation theory at SBU

Register machine interpreter written in C

A series of bachelor's homework in LaTeX

Website implementation of Rule 110 automata

LIeC - Linguaggi, Interpreti e Compilatori presso l'Università degli Studi di Parma (9 CFU).

Interactive application for finding connected and minimum automaton given an automaton.

Interactive program to check if a given String is generated by a given context-free grammar using CYK algorithm

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

Programming paradigms & features, theoretical languages, turing machines, grammars, and regular expressions.

Un cadre formel et axiomatisé pour décrire au mieux l'univers et servir de base à l'élaboration de théories computationelles du tout, dont la construction est libre, ouverte et contributive.

Contains programs I write that may or may not be useful for the TBA (Teori Bahasa & Automata) course.

Literature review about the theoretical expressive capabilities of (Recurrent) Neural Networks.

LIeC - Linguaggi, Interpreti e Compilatori presso l'Università degli Studi di Parma (9 CFU).

Prácticas de la asignatura de Teoría de la Computación

Multithreaded brute-force search for the 4-state 2-symbol Busy Beaver Turing machine