Automaton Tools
Browse all available automaton tools.
Available tools
- Complete DFA Acceptance Complement Set Complement accepting states only for an explicitly complete deterministic finite automaton; incomplete transition tables reject rather than claim language complement.
- DFA Accepting State Visit Indexes Inventory accepting-state visits in a partial deterministic trace, including initial position zero and retaining repeated state visits.
- DFA Alphabet Symbol Usage Table Inventory declared alphabet usage across deterministic transition occurrences and distinct source states, including unused symbols with empty evidence.
- DFA Alphabet Transition Completeness Audit every declared state/alphabet pair for absent transition keys in a finite deterministic automaton; no sink completion or unbounded alphabet.
- DFA Coaccessible State Inventory Compute finite declared automaton reverse reachability from explicit accepting states; no minimization or language equivalence claim.
- DFA Dead State Partitioner Compute finite declared automaton reverse reachability from explicit accepting states and its declared-state complement; no minimization or language equivalence claim.
- DFA Deterministic Transition Key Audit Audit repeated deterministic automaton source-state/symbol keys, including identical repeated targets; no silent first/last transition selection.
- DFA First Undefined Transition Finder Locate the first undefined transition in a supplied partial deterministic input trace, retaining state and symbol or null when complete.
- DFA Reachable State Inventory Compute finite declared automaton forward reachability from an explicit start state; no minimization or language equivalence claim.
- DFA Single Symbol Step Step one supplied deterministic transition table, returning explicit undefined/null when no source/symbol pair exists; duplicate keys reject.
- DFA State Renaming Transform Apply an explicit injective automaton state renaming to a validated deterministic transition table; collisions reject, no label coercion.
- DFA Symbol Renaming Transform Apply an explicit injective automaton alphabet-symbol renaming to a validated deterministic transition table; collisions reject, no label coercion.
- DFA Symbol Sequence Acceptance Evaluate exact finite input acceptance only when every transition is defined and the observed final state is explicitly accepting; no language inference.
- DFA Symbol Sequence State Trace Trace supplied symbols through a deterministic partial automaton, retaining transition occurrence indexes and first undefined symbol index; stops without inventing a sink.
- DFA Transition Adjacency Records Expose labeled outgoing adjacency with original transition indexes for every declared deterministic automaton state, including states without outgoing edges.
- DFA Transition Occurrence Counts Count supplied transition occurrence use along a deterministic symbol trace, retaining unused transitions and first undefined input evidence.
- DFA Transition Target State Coverage Audit transition source and target state references independently against an explicit declared state bank; no inferred undeclared states.
- DFA Unreachable State Partitioner Compute finite declared automaton forward reachability from an explicit start state and its declared-state complement; no minimization or language equivalence claim.