Jun 29, 2018 · This paper investigates the syntactic complexity of certain classes of submonoids accepted by circular semi-flower automata (in short, CSFA). We ...

Jun 14, 2013 · Abstract:We investigate the syntactic complexity of certain types of finitely generated submonoids of a free monoid. In fact, we consider ...

Abstract. We investigate the syntactic complexity of a class of circular semi-flower automata (CSFA) classified by their bpi(s) – branch point(s) going in.

We investigate the syntactic complexity of certain types of finitely generated submonoids of a free monoid. In fact, we consider those submonoids which are ...

We investigate the syntactic complexity of a class of circular semi-flower automata (CSFA) classified by their bpi(s) – branch point(s) going in.

Nov 29, 2019 · Abstract. Semi-flower languages are those of the form L* for some finite maximal prefix code L, or equivalently, those recognizable by a so- ...

On Syntactic Complexity of Circular Semi-flower Automata · List of references · Publications that cite this publication.

We investigate the syntactic complexity of a class of circular semi-flower automata (CSFA) classified by their bpi(s) – branch point(s) going in.

TL;DR: This paper proves that every semi-flower automaton is a one-cluster automaton, and it is proved that every circular automaton with a prime number of ...

We investigate the syntactic complexity of a class of circular semi-flower automata (CSFA) classified by their bpi(s) – branch point(s) going in.