On nonpermutational transformation semigroups with an application to syntactic complexity
Formal Languages and Automata Theory
2014-03-03 v1
Abstract
We give an upper bound of for the possible largest size of a subsemigroup of the full transformational semigroup over elements consisting only of nonpermutational transformations. As an application we gain the same upper bound for the syntactic complexity of (generalized) definite languages as well.
Keywords
Cite
@article{arxiv.1402.7289,
title = {On nonpermutational transformation semigroups with an application to syntactic complexity},
author = {Szabolcs Ivan and Judit Nagy-Gyorgy},
journal= {arXiv preprint arXiv:1402.7289},
year = {2014}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1304.5714