A C++ library for simulating automata and Turing machines

📝 Uma maquina de Turing feita pela disciplina Linguagens Formais e Automatos na realização do Bacharelado de Ciencia da Computação

Trabalho da materia de TLFAC 2022/2

C++ header-only library to run finite-state automata efficiently using all available hardware threads.

Automata simulator written in C++ and SDL2

A C++ Automata simulator that models and visualizes automata using JSON inputs and generates .dot files for visualization. Built for the "Languages & Automata" 1st bachelor course at the University of Antwerp.

Non-Deterministic Finite Automata Simulation

“形式语言与自动机” 玩具模拟两带图灵机，并实现了函数f(a,x,b,y)=a*x^2+b*y ][ Simulating two tape Turing machine which implements the function f(a,x,b,y)=a*x^2+b*y ]

Simulators of the automata for the pseudocatenation and pseudocube of formal languages (https://hal.archives-ouvertes.fr/hal-00458695/fr/). We hope to use these to find an upper bound on the state complexity of the automata for the pseudocube case.

Implementations of Automata Theory Machines