Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.
-
Updated
Mar 19, 2017 - Python
Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.
Projeto e implementação de uma classe que representa um Autômato Finito Determinístico. Trabalho realizado no 5º período de Ciência da Computação do Instituto Federal de Minas Gerais(IFMG) - Campus Formiga para a Disciplina Linguagens Formais e Autômatos.
Program to make NFA from Regular Expression and make it to DFA then simplify it! Then parse a Pascal program.
From a image containing the handwritten automaton, generating the latex code from it.
Python implementation of DFA and Turing Machine
根据正则表达式生成其对应 DFA 的状态转移图
🔃 Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator 🔀
Introduction to automata theory, languages and computation
🖨️ Formal Languages and Compiler Design Uni Laboratory tasks
Implementation of finite-state machines and exportation to dot format
First partial project carried out for the computational mathematics course.
Conversions between NFA, DFA, regex and DFA minimization, Automata Theory | Spring 2021
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
My codes for assignments for Automata Theory Course Spring 2021
eNFA - NFA, DFA - DFA minimization, CNF and CKY
Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression
Theory of languages and automata projects in forth semester of university
Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata
Add a description, image, and links to the dfa-minimization topic page so that developers can more easily learn about it.
To associate your repository with the dfa-minimization topic, visit your repo's landing page and select "manage topics."