On nonpermutational transformation semigroups with an application to syntactic complexity

Iván Szabolcs and Nagy-György Judit: On nonpermutational transformation semigroups with an application to syntactic complexity. In: Acta cybernetica, (22) 3. pp. 687-701. (2016)

[thumbnail of actacyb_22_3_2016_9.pdf]
Preview
Cikk, tanulmány, mű
actacyb_22_3_2016_9.pdf

Download (421kB) | Preview

Abstract

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2016
Volume: 22
Number: 3
ISSN: 0324-721X
Page Range: pp. 687-701
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/41665/
DOI: 10.14232/actacyb.22.3.2016.9
Uncontrolled Keywords: Programozás - szintaxis
Additional Information: Bibliogr.: p. 700-701. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2017. Mar. 16. 13:52
Last Modified: 2022. Jun. 20. 13:02
URI: http://acta.bibl.u-szeged.hu/id/eprint/40270

Actions (login required)

View Item View Item