Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)
-
Updated
Jun 19, 2023 - Python
Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)
Important programs for Automata Lab for C.S.E 4th Sem.
Programs covered in compiler design lab (CEN-603)
A simple script to convert Python regular expression to expressions following the formal defintion
Determinization and minimization of NFA
This repository contains solutions to some of the most commonly existing problems in automata and computation.
Lambda-NFA to DFA real-time visualizer
A lex program which convert NFA to DFA and simulate DFA using its transtion table. and return matches or not
Small program that generates a transition function from nondeterministic finite automation to deterministic finite automation
TA questions and answers of the second semester of 1402 - 1403
Text-based interface written in Rust to convert between λ-NFAs, NFAs and DFAs
fsmconv is a command-line tool for converting FSA from one to another representation.
Manipulation of non-deterministic finite automata (NFAs) and deterministic finite automata (DFAs. Include conversions between NFA, DFA, and regex strings.
Automata implementations
Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata
编译原理实验一,Haskell绝赞复刻-ing
This repository holds my submissions for our Automata Theory and Formal Languages class. The first project converts NFAs to DFAs, the second one converts CFGs to Chomsky Normal Form and the last one is a Turing Machine.
Implementation of fully-functioned finite automata (DFA/NFA), also include schematically implementation
Add a description, image, and links to the nfa-to-dfa-conversion topic page so that developers can more easily learn about it.
To associate your repository with the nfa-to-dfa-conversion topic, visit your repo's landing page and select "manage topics."