dpda

A C++ library for simulating automata and Turing machines

A modern, interactive desktop application for visually designing and simulating various types of automata., for theoretical computer science.

Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.

Automata Simulator — A Python implementation that takes a formal DFA/DPDA definition, validates it against all DFA/DPDA formation rules, and simulates it on input strings with a step-by-step trace and accept/reject verdict.

A project on Deterministic CFGs and Push Down Automata for TOC, Ashoka University

C++ simulators for DFA and DPDA — validates machine definitions, traces execution step-by-step, and tells you exactly why a string got accepted or rejected.

Interactive Pushdown Automata simulator supporting both deterministic (DPDA) and nondeterministic (NPDA) execution, with step-through playback, live stack visualisation, and static determinism checking.