On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity

On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity

We give an upper bound of n((n-1)!-(n-3)!) for the possible largest size of a subsemigroup of the full transformational semigroup over n elements consisting only of nonpermutational transformations. As an application we gain the same upper bound for the syntactic complexity of (generalized) definite...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Acta cybernetica (Szeged) 2016, Vol.22 (3), p.687-701
Hauptverfasser: Iván, Szabolcs, Nagy-György, Judit
Format: Artikel
Sprache:eng
Schlagworte:
Complexity
Upper bounds
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We give an upper bound of n((n-1)!-(n-3)!) for the possible largest size of a subsemigroup of the full transformational semigroup over n 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.
ISSN:0324-721X
DOI:10.14232/actacyb.22.3.2016.9