This chapter gives an overview on what is often called the algebraic theory of finite automata. It deals with languages, automata and semigroups, and has connections with model theory in logic,… (More)

The most important tool for classifying recognizable languages is Eilenberg’s variety theorem [1], which gives a one-to-one correspondence between (pseudo)-varieties of finite semigroups and… (More)

This article is a contribution to the algebraic theory of automata, but it also contains an application to Büchi’s sequential calculus. The polynomial closure of a class of languagesC is the set of… (More)

Assembly of fully functional GABA(B) receptors requires heteromerization of the GABA(B(1)) and GABA(B(2)) subunits. It is thought that GABA(B(1)) and GABA(B(2)) undergo coiled-coil dimerization in… (More)

This paper is concerned with the many deep and far reaching consequences of Ash’s positive solution of the type II conjecture for finite monoids. After rewieving the statement and history of the… (More)

In their more general form, our equations are of the form u → v, where u and v are profinite words. The first result not only subsumes Eilenberg-Reiterman’s theory of varieties and their subsequent… (More)

We study the expressive power of linear propositional temporal logic interpreted on finite sequences or words. We first give a transparent proof of the fact that a formal language is expressible in… (More)

One of the basic tasks in compiler construction, document processing, hypertext software and similar projects is the efficient construction of a finite automaton from a given rational (regular)… (More)