在线可视化地设计、运行自动机，支持DFA和TM Feel free to create & run your DFA and TM🍩Based on React+Next.js+Mobx+Vis Network

Materiale del tutorato del corso di Automi e Linguaggi Formali della laurea triennale di Informatica dell'Università degli Studi di Padova nell'anno 2023-2024

A parser for regex expressions, converting them to equivalent ER (regular expressions), then to corresponding Nondeterministic & Deterministic Finite-State Machine (NFA & DFA) built for checking validity of given strings.

LaTeX notes of Automata, Languages and Computation (Automi, Linguaggi e Computazione) course from Computer Engineering master course at University of Padua, 2019.

A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.

Individual projects written during college

Syntax validation of a programming language by writing the Context Free Grammar for the specific construct of a particular language and a program for the same.

A simple parser as a final task of Automata Theory and Languages at Telkom University.

Cheatsheet for the course "Automata and Formal Languages" at the Bern University of Applied Sciences

Trabalho para disciplina de Teoria da Linguagem na UFSJ. Transformação de uma ER em um AFN, e implementação do AFN.

Contains all my implementations for the lab portion of the course 18CSE304J - Compiler Design (in C or C++).

Turing Machines Compositionality, the Ripper-Carry Adder https://medium.com/@martincorona007/full-adder-f10c4de4b6d7

Tugas Komputasional TBA 2023-2024 Genap

Python program to interpret pushdown automata [College]

An automatic door opening system using finite state machine.

Reconocedor de lenguaje implementado en Web

Automatix is software for experimenting with formal languages topics like AFD and AFnD

Python constructs parser built using lex and yacc

Tablero de robots controlado por comandos