scientific article; zbMATH DE number 3287733
From MaRDI portal
Publication:5570933
Cited in
(only showing first 100 items - show all)- On the semigroups of linear sequential machines
- Complete endomorphisms of the lattice of pseudovarieties of finite semigroups
- Green index in semigroups: generators, presentations, and automatic structures.
- From relation to emulation: The covering lemma for transformation semigroups
- Generalized algebraic structures for the representation of discrete systems
- The group-theoretic complexity of subsemigroups of Boolean matrices
- Infinite-vertex free profinite semigroupoids and symbolic dynamics.
- CAYLEY AUTOMATON SEMIGROUPS
- Isomorphisms of wreath products of monoids. I
- On \(\alpha _ 0\)-products and \(\alpha _ 2\)-products
- ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
- On decomposition of nonlinear control systems
- Significance arithmetic: The probability of carrying
- Representations of relatively free profinite semigroups, irreducibility, and order primitivity
- On multisemigroups.
- Improved lower bounds for the complexity of finite semigroups
- On residual finiteness of monoids, their Schützenberger groups and associated actions.
- On the irreducible representations of a finite semigroup
- ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS
- Pointlike sets and separation: a personal perspective
- The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)
- Multichannel digital systems and Information theory II. Verification of an experimental result on the optical perception
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
- Iteration of expansions. Unambiguous semigroups
- John Rhodes and the theory of finite semigroups.
- A note on series parallel irreducibility
- Subgroups of free idempotent generated semigroups need not be free.
- On subsystems of a fuzzy finite state machine
- Lower bounds for complexity of finite semigroups
- The complexity of economic decision rules
- Book review of: J. Rhodes and B. Steinberg, The \(\mathfrak q\)-theory of finite semigroups
- Structure of subsemigroups of factor-powers of finite symmetric groups
- Sur le produit de concatenation non ambigu
- A new proof of the Krohn-Rhodes theorem for transformation semigroups
- Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
- Representations of Semigroups and the Translational Hull of a Regular Rees Matrix Semigroup
- On the cohomology of finite semigroups
- Inverse semigroups and extensions of groups by semilattices
- The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case
- On classification of maximal nilpotent subsemigroups.
- Remarks on algebraic decomposition of automata
- Algebraic representations for finite-state machines. II: Module formulation
- Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
- The global dimension of the full transformation monoid (with an appendix by V. Mazorchuk and B. Steinberg)
- Product expansions
- The semilattices of nilextensions of left groups and their varieties
- Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC
- On the prime decomposition theorem for finite monoids
- A proof of the Krohn--Rhodes Decomposition Theorem
- Almost finite expansions of arbitrary semigroups
- On the minimal faithful degree of Rhodes semisimple semigroups
- On the fixpoints of monogenic functions in free monoids
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
- An Improved Upper Bound for Global Dimension of Semigroup Algebras
- On a characterization of the nonregular set of primes
- On topological machines
- MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
- Blocking of group automata. II: Mutual interlocking.
- Normal distributions of finite Markov chains
- Infinite iteration of matrix semigroups. I: Structure theorem for torsion semigroups
- Non-uniform automata over groups
- Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets
- On effectively computable realizations of choice functions
- On nilpotent subsemigroups of the order-decreasing transformation semigroups
- Endomorphism monoids of free acts and O-wreath products of monoids. I. Annihilator properties
- A tribute to John B. Fountain
- Pointlike sets with respect to R and J.
- On the complexity of finite semigroups
- Groups acting on semimetric spaces and quasi-isometries of monoids.
- Maximally independent sets, minimal generating sets, and irreducibles
- Cascade connections and triangular products of linear automata
- Acts over semigroups
- Degree 2 transformation semigroups as continuous maps on graphs: foundations and structure
- On approximation of locally compact groups by finite algebraic systems
- On the lattice of subvarieties of the wreath product of the variety of semilattices and the variety of semigroups with zero multiplication
- Effective dimension of finite semigroups.
- Synergy in machines
- Financial laws as algebraic automata
- Computing the ideal structure of finite semigroups
- Projective indecomposable modules and quivers for monoid algebras
- ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES
- A generalization of the Schützenberger product of finite monoids
- On uniformity within \(NC^ 1\)
- Once more on the lattice of subvarieties of the wreath product of the variety of semilattices and the variety of semigroups with zero multiplication
- Results on homomorphic realization of automata by \(\alpha_ 0\)-products
- scientific article; zbMATH DE number 2051828 (Why is no real title available?)
- Embedding of regular semigroups in wreath products
- Embedding of regular semigroups in wreath products. II
- Embedding of regular semigroups in wreath products. III
- Critical classes for the \(\alpha _ 0\)-product
- Completeness and the finite model property for Kleene algebra, reconsidered
- Complete classes of automata for the \(\alpha _ 0\)-product
- Heights of one- and two-sided congruence lattices of semigroups
- On finite 0-simple semigroups and graph theory
- Locally testable semigroups
- On the Wilson monoid of a pairwise balanced design
- Some contributions to the theory of transformation monoids
- Relationship between combinatorics and O-simple semigroups
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)