State complexity and the monoid of transformations of a finite set

From MaRDI portal



Abstract: In this paper we consider the state complexity of an operation on formal languages, root(L). This naturally entails the discussion of the monoid of transformations of a finite set. We obtain good upper and lower bounds on the state complexity of root(L) over alphabets of all sizes.












This page was built for publication: State complexity and the monoid of transformations of a finite set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463982)