This is a C++ command-line tool to convert a Non-Deterministic Finite Automaton (NFA) into a Deterministic Finite Automaton (DFA). It allows you to input custom NFA components and outputs both the original NFA transition table and the generated DFA transition table.

• Accepts user-defined:
  • States
  • Start state
  • Final states
  • Input symbols
  • Transitions (with support for multiple next-states per symbol)
• Converts NFA to DFA by combining states
• Outputs clean and readable:
  • NFA Transition Table
  • DFA Transition Table
• Handles composite DFA states like {q0,q1}

• Finite Automata
• Deterministic and Non-deterministic transitions
• Queue-based BFS for state exploration
• Set operations and string manipulation
• Transition table representation with tuples

Use any C++ compiler, such as g++:

g++ nfa_to_dfa.cpp -o nfa_to_dfa

./nfa_to_dfa

States: One per line (e.g., q0, q1, q2). End with -1.

Start State: Single input (e.g., q0)

Final States: One per line. End with -1.

Symbols: One per line (e.g., a, b). End with -1.

Transitions:

For each state-symbol pair, enter destination states separated by space.

End each input with a . (dot) to finish that line.

Example: q0 q1 .

States:        q0, q1, q2
Start State:   q0
Final States:  q2
Symbols:       a, b

Transitions:
For q0:
  a → q0 q1
  b → q0
For q1:
  a → -
  b → q2
For q2:
  a → -
  b → -

========================================
             NFA TRANSITION TABLE        
========================================
STATE   | SYMBOL        | NEXT STATE
----------------------------------------
q0      | a             | q0,q1
q0      | b             | q0
q1      | a             | 
q1      | b             | q2
q2      | a             | 
q2      | b             | 

========================================
           DFA TRANSITION TABLE          
========================================
STATE          | SYMBOL        | NEXT STATE
----------------------------------------
{q0}           | a             | {q0,q1}
{q0}           | b             | {q0}
{q0,q1}        | a             | {q0,q1}
{q0,q1}        | b             | {q0,q2}
...

nfa_to_dfa/
│
├── nfa_to_dfa.cpp       # Main C++ source file
└── README.md            # Project documentation

Pull requests are welcome. For major changes, please open an issue first to discuss your ideas.

If you'd like to:

• Add epsilon (ε) transition support

• Minimize the DFA

• Add unit tests

Feel free to fork and contribute!

This project is open source under the MIT License.