We present ACME, a tool implementing algebraic techniques to solve decision problems from automata theory. The core generic algorithm takes as input an automaton and computes its stabilization monoid, which is a generalization of its transition monoid.
Using the stabilization monoid, one can solve many problems: determine whether a
-automaton (which is a special kind of automata with counters) is limited, whether two
-automata are equivalent, and whether a probabilistic leaktight automaton has value 1.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten