Moore machines duality
Jacques Peyri\`ere
TL;DR
This paper introduces a straightforward algorithm for minimizing Moore machines by finding the equivalent machine with the fewest states, enhancing efficiency in automata design.
Contribution
The paper proposes a novel, simple algorithm for minimizing Moore machines, improving upon existing methods in terms of simplicity and effectiveness.
Findings
Algorithm successfully minimizes Moore machines efficiently.
Reduces state complexity in automata design.
Applicable to various automata minimization tasks.
Abstract
We present a simple algorithm to find the Moore machine with the minimum number of states equivalent to a given one.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Machine Learning and Algorithms