The Holonomy Decomposition of Circular Semi-Flower Automata
Shubh Narayan Singh, K. V. Krishna
TL;DR
This paper applies Eilenberg's holonomy decomposition to a specific class of circular semi-flower automata, revealing their structural properties and cycle characteristics.
Contribution
It extends holonomy decomposition techniques to circular semi-flower automata, providing new insights into their structure and cycle absence.
Findings
Holonomy decompositions of certain circular semi-flower automata are established.
The work characterizes the absence of certain cycles in these automata.
Structural properties of the automata are elucidated.
Abstract
Eilenberg's holonomy decomposition is useful to ascertain the structural properties of automata. Using this method, Egri-Nagy and Nehaniv characterized the absence of certain types of cycles in automata. In the direction of studying the structure of automata with cycles, this work focuses on a special class of semi-flower automata and establish the holonomy decompositions of certain circular semi-flower automata.
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 · DNA and Biological Computing · Advanced Algebra and Logic