scientific article

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

bibliography finite automata Green relations regular languages hierarchies finite monoids varieties of semigroups varieties of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Bilateral locally testable languages., On varieties of rational languages and variable length codes. II, Groups in the syntactic monoid of a composed code, Addition molle et fonctions p-locales, On some equations in free partially commutative monoids, First-order logic and star-free sets, Rabin tree automata and finite monoids, Function composition and automatic average case analysis, Representations and identities of plactic-like monoids, Over testable languages, Polynomial closure and unambiguous product, Pseudovarieties of completely regular semigroups, Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words), Membership testing in commutative transformation semigroups, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif, Two algebraic approaches to variants of the concatenation product, Partially ordered finite monoids and a theorem of I. Simon, On the Burnside problem for semigroups of matrices in the $(\max,+)$ algebra, Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups), Programs over aperiodic monoids, Inverse monoids of dot-depth two, Testing membership: Beyond permutation groups, Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$, Sur le produit avec compteur modulo un nombre premier, Schützenberger and Eilenberg theorems for words on linear orderings, Catalan monoids inherently nonfinitely based relative to finite $\mathscr{R}$-trivial semigroups, Products of languages with counter, Covers for monoids., Bisections reconnaissables, Petri net languages and infinite subsets of $\mathbb{N}^m$, The product of rational languages, Results on homomorphic realization of automata by $\alpha_ 0$-products, On the semidirect product of the pseudovariety of semilattices by a locally finite pseudovariety of groups, PSPACE-completeness of certain algorithmic problems on the subgroups of free groups, Algebraic and topological theory of languages, Polynomial operations and hierarchies of concatenation, AUTOMATE, a computing package for automata and finite semigroups, Varieties and rational functions, Games, equations and dot-depth two monoids, Algebraic recognizability of regular tree languages, Regular splicing languages and subclasses, Linear splicing and syntactic monoid, Recognizable subsets of some partially Abelian monoids, Expressive power of existential first-order sentences of Büchi's sequential calculus, On dot-depth two, An application of the Ehrenfeucht-Fraisse game in formal language theory, The pseudovariety of semigroups of triangular matrices over a finite field, Complementation of Branching Automata for Scattered and Countable N-Free Posets, Enumerated BSP Automata, The join of the pseudovarieties of $\mathcal R$-trivial and $\mathcal L$-trivial monoids, An undecidable problem about rational sets and contour words of polyominoes, On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics, Languages recognized by finite aperiodic groupoids, A characterization of s-languages, Games, equations and the dot-depth hierarchy, Decomposition techniques for finite semigroups, using categories. I, \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata, Families of locally testable languages, Varieties and pseudovarieties of ordered normal bands, Free profinite $\mathcal R$-trivial, locally idempotent and locally commutative semigroups, Right and left locally testable languages, On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids, Algebraic tools for the concatenation product., Equations and monoid varieties of dot-depth one and two, Logic over words on denumerable ordinals, A conjecture on the concatenation product, On a complete set of generators for dot-depth two