Exact generation of acyclic deterministic finite automata
Marco Almeida, Nelma Moreira, and Rog\'erio Reis
TL;DR
This paper introduces a canonical form for trim acyclic deterministic finite automata and presents a backtracking algorithm for their exact generation, extending previous work on minimal acyclic automata.
Contribution
It provides a new normal form for acyclic DFA and adapts existing algorithms for their precise enumeration.
Findings
Canonical representation for acyclic DFA established
Backtracking algorithm for exact generation developed
Extension of minimal acyclic DFA enumeration method
Abstract
We give a canonical representation for trim acyclic deterministic finite automata (Adfa) with n states over an alphabet of k symbols. Using this normal form, we present a backtracking algorithm for the exact generation of Adfas. This algorithm is a non trivial adaptation of the algorithm for the exact generation of minimal acyclic deterministic finite automata, presented by Almeida et al.
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
Topicssemigroups and automata theory · Formal Methods in Verification · Chemical Synthesis and Analysis