scientific article; zbMATH DE number 3287733

Cited in

(only showing first 100 items - show all)

Infinite-vertex free profinite semigroupoids and symbolic dynamics.
Embedding of regular semigroups in wreath products
Infinite iteration of matrix semigroups. I: Structure theorem for torsion semigroups
On effectively computable realizations of choice functions
Notes on finitely generated semigroups and pumping conditions for regular languages
Embedding of regular semigroups in wreath products. II
Embedding of regular semigroups in wreath products. III
Isomorphisms of wreath products of monoids. I
Complete classes of automata for the \(\alpha _ 0\)-product
On \(\alpha _ 0\)-products and \(\alpha _ 2\)-products
The synthesis theorem for finite regular semigroups, and its generalization
Partially ordered finite monoids and a theorem of I. Simon
A new proof of the Krohn-Rhodes theorem for transformation semigroups
Relationship between combinatorics and O-simple semigroups
Endomorphism monoids of free acts and O-wreath products of monoids. I. Annihilator properties
A generalization of the Schützenberger product of finite monoids
On decomposition of nonlinear control systems
Synergy in machines
Results on homomorphic realization of automata by \(\alpha_ 0\)-products
On the complexity of finite semigroups
On the fixpoints of monogenic functions in free monoids
Computing the ideal structure of finite semigroups
Relationships between combinatorics and 0-simple semigroups
On topological machines
Significance arithmetic: The probability of carrying
Sur le produit de concatenation non ambigu
The complexity of economic decision rules
The group-theoretic complexity of subsemigroups of Boolean matrices
The semilattices of nilextensions of left groups and their varieties
On calculating the Krohn-Rhodes decomposition of automata
Generalized algebraic structures for the representation of discrete systems
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
A proof of the Krohn--Rhodes Decomposition Theorem
On the lattice of subvarieties of the wreath product of the variety of semilattices and the variety of semigroups with zero multiplication
Some contributions to the theory of transformation monoids
Unified theory for finite Markov chains
On \(\alpha{}_ 0-\nu{}_ 1\)-products of automata
Pointlike sets: the finest aperiodic cover of a finite semigroup
Decomposition techniques for finite semigroups, using categories. I
Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets
Product expansions
Covers for regular semigroups and an application to complexity
On subsystems of a fuzzy finite state machine
Operators and products in the lattice of existence varieties of regular semigroups
From relation to emulation: The covering lemma for transformation semigroups
Structure of subsemigroups of factor-powers of finite symmetric groups
Green index in semigroups: generators, presentations, and automatic structures.
Effective dimension of finite semigroups.
Once more on the lattice of subvarieties of the wreath product of the variety of semilattices and the variety of semigroups with zero multiplication
A tribute to John B. Fountain
More on the descriptional complexity of products of finite automata
On nilpotent subsemigroups of the order-decreasing transformation semigroups
On the Wilson monoid of a pairwise balanced design
Locally testable semigroups
Finite semigroup varieties of the form V*D
Book review of: J. Rhodes and B. Steinberg, The \(\mathfrak q\)-theory of finite semigroups
On multisemigroups.
Self-automaton semigroups.
Subgroups of free idempotent generated semigroups need not be free.
Blocking of group automata. I: One-sided interlocking
John Rhodes and the theory of finite semigroups.
Automata in algebra
Pointlike sets with respect to R and J.
Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
On a characterization of the nonregular set of primes
On the cohomology of finite semigroups
Dot-depth of star-free events
Homological dimension in semigroup algebras
On the computational complexity of finite functions and semigroup multiplication
A generalization of the Rees theorem to a class of regular semigroups
Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
Locally testable languages
Cofunction in composite systems
Improved lower bounds for the complexity of finite semigroups
Lower bounds for complexity of finite semigroups
Algebraic representations for finite-state machines. II: Module formulation
On uniformity within \(NC^ 1\)
Acts over semigroups
The global dimension of the full transformation monoid (with an appendix by V. Mazorchuk and B. Steinberg)
ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS
Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
Further results on monoids acting on trees.
COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS
CAYLEY AUTOMATON SEMIGROUPS
On the irreducible representations of a finite semigroup
ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
On residual finiteness of monoids, their Schützenberger groups and associated actions.
SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
Maximally independent sets, minimal generating sets, and irreducibles
COMPLEXITY AND INFORMATION TECHNOLOGY IN DYNAMIC SYSTEMS
Multichannel digital systems and Information theory II. Verification of an experimental result on the optical perception
Financial laws as algebraic automata
Complete endomorphisms of the lattice of pseudovarieties of finite semigroups
scientific article; zbMATH DE number 2051828 (Why is no real title available?)
Projective indecomposable modules and quivers for monoid algebras
ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC
On approximation of locally compact groups by finite algebraic systems
On the semigroups of linear sequential machines
Groups acting on semimetric spaces and quasi-isometries of monoids.
Degree 2 transformation semigroups as continuous maps on graphs: foundations and structure

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5570933)