Syntactic Complexity of Circular Semi-Flower Automata
Formal Languages and Automata Theory
2013-06-17 v1
Abstract
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 semi-flower automata (CSFA). Here, we show that the syntactic complexity of CSFA with at most one `branch point going in' (bpi) is linear. Further, we prove that the syntactic complexity of -state CSFA with two bpis over a binary alphabet is .
Keywords
Cite
@article{arxiv.1306.3492,
title = {Syntactic Complexity of Circular Semi-Flower Automata},
author = {Shubh Narayan Singh and K. V. Krishna},
journal= {arXiv preprint arXiv:1306.3492},
year = {2013}
}