automata-toolbox 2.0

A Python CLI for DFA, NFA, PDA, and CFG simulation

Automata-Toolbox

Overview

Automata Toolbox is a Python framework designed for simulating various types of automata used in computational theory. It supports the following automata types:

• Deterministic Finite Automata (DFA)
• Non-Deterministic Finite Automata (NFA)
• Pushdown Automata (PDA)
• Context-Free Grammar (CFG)

This framework allows users to define and execute automata using structured configuration files or Python classes. It provides utilities for parsing, validation, and simulation of automata, making it an ideal tool for learning and experimentation.

---

Features

✅ Full Automata Simulation - Supports DFA, NFA, PDA, and CFG. ✅ Structured Configuration - Automata are defined using .cfg configuration files. ✅ Python API - Automata can be created and run programmatically. ✅ Command-Line Interface (CLI) - Automata can be managed directly from the terminal. ✅ Extensible and Modular - Designed to be modified and extended easily.

---

Installation

Automata Toolbox requires Python 3.7+. Install it via pip:

pip install automata_toolbox

Alternatively, you can install it from source:

git clone https://github.com/Cris24dc/Automata-Toolbox.git
cd Automata-Toolbox
pip install -e .

---

CLI Usage

Generate an Automaton Template

automata generate dfa my_dfa

Supported automaton types: dfa, nfa, pda, cfg.

Run a DFA on an Input String

python3 -m toolbox.main config/my_dfa.cfg abba

---

Using the Python API

Creating and Running a DFA

from toolbox import DFA

dfa = DFA("config/example.cfg")
if dfa.is_valid():
    print("DFA is valid")
    print(dfa.run("abba"))

Using an NFA

from toolbox import NFA

nfa = NFA("config/example_nfa.cfg")
if nfa.is_valid():
    print("NFA is valid")
    print(nfa.run("abba"))

---

Configuration Files

Each automaton type requires a .cfg file structured as follows:

DFA Configuration Example

[Sigma]
a
b
end

[States]
q0
q1
end

[Start]
q0
end

[Final]
q1
end

[Delta]
q0 a q1
q1 b q0
end

CFG Configuration Example

[Variables]
S
end

[Terminals]
a
b
end

[Rules]
S -> aSb
S -> $
end

---