Skip to content

A Python tool for simulating Deterministic Finite Automata (DFAs) by reading transition tables from Excel files. It checks if input strings are accepted, supports verbose output for detailed DFA information, and ensures all transitions are defined. Object-oriented, user-friendly, and ideal for theoretical computer science education.

active 2025-02-232025-03-01 (UTC)

Partial coverage16,459 / 20,760 hourly files (79%) · 2 absent upstream · 4,300 failed, retryable2024-03-302026-08-12 (UTC)— sampled evenly across the window, so rankings and trends hold; absolute counts scale up.
Events
6
Pushes
2
Pull requests
0
Issues
1
Stars
1
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 7 days from 2025-02-23 to 2025-03-01. Pushes: 2 total, peak 2 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 1 total, peak 1 in a day. Comments: 0 total, peak 0 in a day. Stars: 1 total, peak 1 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
coderatul3200

Recent activity

Latest issues, pull requests and releases

  • Issue#1coderatul2025-03-01 11:54
    wiki

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 1 stars here means stars gained during the window, not the repo's star count.