Finite semigroups and recognizable languages: an introduction

(Bounds for finite languages and upward and downward closures have recently been investigated by Karandikar and Schnoebelen [16].) The observation reduces Step 2 to solving a

Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we establish that the average state complexities of the rational operations

In [3], it is proved that once k is fixed, Parikh’s Theorem [15] can be used to prove that whether a language is LTT[k, d] for some d can be rephrased as a computable Presburger

We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification

In particular, the expressive power of fragments of monadic second-order logic and various fixed- point logics has already been investigated in some of the earliest papers in finite

Rational and context-free trace languages can be defined as in the case of free monoids and their main properties are well-known (see, for instance, [16, 6, 5, 14, 1]). In

The notion of type is extended to these graphs by defming the type of an arbitrary graph g to be the type of symr (g), We will recall now the main resuit of [ER] which characterizes

It is well known that a topology can be described in some ways: ciosure operator, family of open sets, interior operator, neighbourhood System, etc.. (We refer for