On Deterministic Finite Automata and Syntactic Monoid Size, Continued
In: Proceedings of the 7th International Conference on Developments in Language Theory, DLT 2003. - (Lecture Notes in Computer Science ; 2710).
Berlin [u.a.]: Springer (2003), S. 163
Buchaufsatz / Kapitel / Fach: Informatik
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semigroups. We show that for every prime n ≥ 7 there exist natural numbers k and ℓ with n = k + ℓ such that the semigroup U k,ℓ is maximal w.r.t. its size among all (transformation) semigroups which can be generated with two generators. This significantly tightens the bound on the syntactic monoid size of languages accepted by n-state deterministic finite automata with binary input alphabet. As a by-product of our investigations we are able to determine the maximal size among all semigroups generated by two transformations, where one is a permutation with a single cycle and the other is a non-bijective mapping.