State Complexity and the Monoid of Transformations of a Finite Set
classification
🧮 math.GR
math.CO
keywords
complexitystatefinitemonoidroottransformationsalphabetsbounds
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.