A theory of computing project that introduces converting a non-deterministic finite automaton (nfa) to a deterministic finite automaton (dfa).

puzzles, problems, search, sort, graph, constraint, theory, symbolic

Two way slab analysis by Fourier Method

Exercise for Theory of Computation Exam @ Unifi - Turing Machines Simulator.

This model accepts regular language descriptions from users, converts them to DFAs, and minimizes the DFAs. The minimized DFAs are then visualized as images, aiding users in understanding language structures. Implemented in Python, graph visualization tools, and minimization algorithms.

Library for defining and working with abstract regular expressions that support strings/sequences with elements of any symbol type, with an emphasis on supporting scenarios in which it is necessary to work with regular expressions as abstract mathematical objects.

This project aims to implement fundamentals of theory of computation; such as DFAs, NFAs and more.

I have created a Turing Machine that can be used as a language acceptor, transducer, or to solve complicated tasks.

online algo app where you check your string is valid or not

Exercício Programa que faz a emulação de um Autômato Finito Não Determinístico (AFN) para a matéria de Introdução à Teoria da Computação 💻

Building a syntax tree, and deriving a semantic term

A Turing Machine compiler

This package refers to the topic of automata theory, which includes DFA, NDFA, Mealy machines, Moore machines, Finite state machine and Turing machine.

🐝 Spelling Bee's project is a Web Application for the Da Vinci Code Game.

Lab tasks performed for course BSCS-501 Theory of Computer Science.

Simple program to manipulate NFAs, DFAs and grammars.

A bunch of simple Automata simulation modules

A simplified compiler for a custom programming language

Theory of computation course (Free university of Tbilisi) assignments.