State Complexity and the Monoid of Transformations of a Finite Set

Simple item page
dc.creatorKrawetz, Bryan
dc.creatorLawrence, John
dc.creatorShallit, Jeffery
dc.date2003-06-29
dc.date2003-12-09
dc.date.accessioned2026-07-07T04:59:16Z
dc.date.available2026-07-07T04:59:16Z
dc.descriptionIn 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.
dc.descriptionAdded discussion of prior work. Generalized results to both even and odd cases. Corrected mistakes
dc.identifierhttps://arxiv.org/abs/math/0306416
dc.identifierhttp://arxiv.org/abs/math/0306416
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67917
dc.subjectGroup Theory
dc.subjectCombinatorics
dc.titleState Complexity and the Monoid of Transformations of a Finite Set
dc.typetext

Files

Collections

arXiv