12 citations · 27 across the 17 of their papers we have counts for
Showing 2013 · cs.FLShow all
2 papers · 2 filters
cs.FL2013
Syntactic Complexity of Circular Semi-Flower Automata
Shubh Narayan Singh, K. V. Krishna
We investigate the syntactic complexity of certain types of finitely generated submonoids of a free monoid. In fact, we consider those submonoids which are accepted by circular sem…
cs.FL2013
The Holonomy Decomposition of Circular Semi-Flower Automata
Shubh Narayan Singh, K. V. Krishna
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…