Simple turing machine simulator using the syntax of the online simulator at turingmachinesimulator.com

A C++ program to convert NFA to DFA

Convert C++-like code into a Turing Machine representation

The CFL Reachability problem involves determining whether there is a path in a graph where the concatenation of edge labels along the path forms a string that belongs to a given context-free language.

Academic Lab Course of the 27th batch of Computer Science & Engineering | University of Rajshahi - 🇧🇩

A collection of notes and resources from various engineering courses, covering key concepts, formulas, and study materials.

Theoretical Foundations: Automata and language theory; computability theory. Uses programming projects to show the relationship between theory and application.

A very simple Turing Machine implementation in C++

Implementation of CYK(Cocke-Younger-Kasami) algorithm https://medium.com/@martincorona007/cyk-algorithm-60d7f869ca0a

🤖 Algoritmos de processamento de autômatos, gramaticas e maquinas de Turing.

This C++ code defines a finite automaton that reads an input string and determines whether it's accepted or rejected based on user-defined transitions, states, and final states. It's a simple representation of automata theory and language recognition.

Regular Expression to Deterministic Finite Automaton Converter.

Comparing the Double Space Saving DS to the Heavy Keeper DS for the real world input streams

A program that takes a dfa as input and output its minimum equivalence states partitions.

Regular processing https://introtheoryofcomputation.blogspot.com/2019/06/regular-processing.html

NFA (nondeterministic finite automaton) simulator using C++

Trabalhos da disciplina Teoria Da Computação - UFMS CPPP

Theory of Computation Final Project

Programs in the domain of Compiler Construction and Automata Formal Language. Some of the problems included are