semigroups and automata theory

No abstract yet.

Much of the massive quantities of digitized data widely available, e.g., text, speech, hand-written sequences, are either given directly, or, as a result of some prior processing, as weighted automata. These are compact representations of a large number of alternative sequences and their weights reflecting the uncerta…

No abstract yet.

special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications We introduce a new model of two-way finite automaton, which is endowed with the capability of resetting the position of the tape head to the left end of the tape in a single move during the computation. Several…

This paper proves a conjecture of G. A. Jones, D. Singerman and K. Wicks, that a suborbital graph for the modular group is a forest if and only if it contains no triangles.

No abstract yet.

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order. We can show that these numbers are related to the well‐known numbers and polyn…

• YILMAZ ŞİMŞEK

No abstract yet.

• NESRİN TUTAŞ

It is proved that the stable commutator length of a Dehn twist in the mapping class group is positive and the tenth power of a Dehn twist about a nonseparating simple closed curve is a product of two commutators. As an application a new proof of the fact that the growth rate of a Dehn twist is linear is given.

• MUSTAFA KORKMAZ

No abstract yet.

• HASAN AKIN

In this paper we consider finite generation and finite presentability of Rees matrix semigroups (with or without zero) over arbitrary semigroups. The main result states that a Rees matrix semigroupM[S; I, J; P]is finitely generated (respectively, finitely presented) if and only ifSis finitely generated (respectively,…

No abstract yet.

• HASAN AKIN