DFA (Deterministic Finite Automata)
-
Updated
Aug 11, 2019 - C
DFA (Deterministic Finite Automata)
First project of Theory of Computation course (IFCE) (2016.1)
A Turing Machine simulator for the language L={0^2^n}
Esse é um exemplo de analisador sintático para validar expressões aritméticas que incluem parênteses, colchetes e chaves.
Trabajo práctico transversal / Teoría de la Computación 1
Compiler assignment for the purposes of the Theory of Computation Lesson in TUC
Fictional Language to C Trans-compiler
Source-to-source compiler(trans-Compiler) on a custom Fictional Language(FL) using Flex & Bison as part of a project on Theory of Computation
Computation Theory project 2024. A transpiler that converts an imaginary language 'lambda' into executable C source code.
Add a description, image, and links to the theory-of-computation topic page so that developers can more easily learn about it.
To associate your repository with the theory-of-computation topic, visit your repo's landing page and select "manage topics."