在线可视化地设计、运行自动机，支持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 2024-2025
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
LaTeX notes of Automata, Languages and Computation (Automi, Linguaggi e Computazione) course from Computer Engineering master course at University of Padua, 2019.
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.
A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.
Individual projects written during college
A C++ simulator exploring Formal Language Theory in information retrieval and bioinformatics. It compiles user queries into NFAs/DFAs for pattern matching and visualization, extends finite automata for biological sequence analysis, and implements Pushdown Automata for recognizing context-free languages such as RNA structures and XML validation.
A simple parser as a final task of Automata Theory and Languages at Telkom University.
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++).
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.
Turing Machines Compositionality, the Ripper-Carry Adder https://medium.com/@martincorona007/full-adder-f10c4de4b6d7
Python program to interpret pushdown automata [College]
Reconocedor de lenguaje implementado en Web
Cheatsheet for the course "Automata and Formal Languages" at the Bern University of Applied Sciences
An interactive compiler design tool that compares LL(1), LR(0), SLR(1), CLR(1), and LALR(1) parsing techniques. Integrated an AI-based grammar validation module that analyzes the grammar and provides structured feedback including issues, corrections, and sample derivations. It is intentionally non-interactive to maintain focus on compiler design ra
An automatic door opening system using finite state machine.
Esto es el contenido de la materia Lenguajes y Automatas, se realizo un proyecto de un analisis léxico y sintáctico de manera individual.
Add a description, image, and links to the automata-and-formal-languages topic page so that developers can more easily learn about it.
To associate your repository with the automata-and-formal-languages topic, visit your repo's landing page and select "manage topics."