The Holonomy Decomposition of Circular Semi-Flower Automata
Formal Languages and Automata Theory
2013-06-12 v1
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.
Keywords
Cite
@article{arxiv.1306.2548,
title = {The Holonomy Decomposition of Circular Semi-Flower Automata},
author = {Shubh Narayan Singh and K. V. Krishna},
journal= {arXiv preprint arXiv:1306.2548},
year = {2013}
}