#

myhill-nerode-theorm

Here are 4 public repositories matching this topic...

tiyabansal / Dfa_Minimization

a c++ program that takes a dfa as input and output its minimum equivalence states partitions and corresponding minimum state transition table.

backtracking dfs dp automata-theory dfa-minimization myhill-nerode-theorm

Updated Jun 4, 2022
C++

nyhead / Finite-Automata-Simulator

NFA to DFA converter, DFA minimization, FA acceptance in Haskell

dfa-minimization reachable nfa-to-dfa-conversion subset-construction dfa-minimization-algorithm myhill-nerode-theorm

Updated Jul 22, 2023
Haskell

tan264 / DFA-minimization

automata dfa-minimization myhill-nerode-theorm

Updated Jun 16, 2023
Java

Rio-Nyx / CD-Lab

compiler-design lexical-analyzer epsilon-nfa myhill-nerode-theorm

Updated Feb 6, 2023
C

Improve this page

Add a description, image, and links to the myhill-nerode-theorm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the myhill-nerode-theorm topic, visit your repo's landing page and select "manage topics."