scientific article; zbMATH DE number 3287733
From MaRDI portal
Publication:5570933
Cited in
(only showing first 100 items - show all)- Partially ordered finite monoids and a theorem of I. Simon
- An Improved Upper Bound for Global Dimension of Semigroup Algebras
- Acts over semigroups
- On subsystems of a fuzzy finite state machine
- On \(\alpha{}_ 0-\nu{}_ 1\)-products of automata
- COMPLEXITY AND INFORMATION TECHNOLOGY IN DYNAMIC SYSTEMS
- On the irreducible representations of a finite semigroup
- Embedding of regular semigroups in wreath products
- Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
- A generalization of the Rees theorem to a class of regular semigroups
- On approximation of locally compact groups by finite algebraic systems
- Pointlike sets and separation: a personal perspective
- The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)
- Iteration of expansions. Unambiguous semigroups
- Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
- Blocking of group automata. I: One-sided interlocking
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
- Embedding of regular semigroups in wreath products. II
- Embedding of regular semigroups in wreath products. III
- Finite semigroup varieties of the form V*D
- CAYLEY AUTOMATON SEMIGROUPS
- Effective dimension of finite semigroups.
- COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS
- Complete endomorphisms of the lattice of pseudovarieties of finite semigroups
- Critical classes for the \(\alpha _ 0\)-product
- Structure of subsemigroups of factor-powers of finite symmetric groups
- MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
- Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets
- ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
- Locally testable semigroups
- Groups acting on semimetric spaces and quasi-isometries of monoids.
- Some contributions to the theory of transformation monoids
- Blocking of group automata. II: Mutual interlocking.
- Unified theory for finite Markov chains
- On the cohomology of finite semigroups
- Cascade connections and triangular products of linear automata
- Infinite iteration of matrix semigroups. I: Structure theorem for torsion semigroups
- The group-theoretic complexity of subsemigroups of Boolean matrices
- Inverse semigroups and extensions of groups by semilattices
- On residual finiteness of monoids, their Schützenberger groups and associated actions.
- On the fixpoints of monogenic functions in free monoids
- ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC
- The complexity of economic decision rules
- On the complexity of finite semigroups
- Complete classes of automata for the \(\alpha _ 0\)-product
- On effectively computable realizations of choice functions
- Non-uniform automata over groups
- Sur le produit de concatenation non ambigu
- Dot-depth of star-free events
- Relationship between combinatorics and O-simple semigroups
- Operators and products in the lattice of existence varieties of regular semigroups
- ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS
- On uniformity within \(NC^ 1\)
- Almost finite expansions of arbitrary semigroups
- Representation theory of finite semigroups over semirings.
- Infinite-vertex free profinite semigroupoids and symbolic dynamics.
- On a characterization of the nonregular set of primes
- Locally testable languages
- Self-automaton semigroups.
- On finite 0-simple semigroups and graph theory
- scientific article; zbMATH DE number 2051828 (Why is no real title available?)
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- Green index in semigroups: generators, presentations, and automatic structures.
- On the lattice of subvarieties of the wreath product of the variety of semilattices and the variety of semigroups with zero multiplication
- Completeness and the finite model property for Kleene algebra, reconsidered
- Subgroups of free idempotent generated semigroups need not be free.
- ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES
- The global dimension of the full transformation monoid (with an appendix by V. Mazorchuk and B. Steinberg)
- On multisemigroups.
- Improved lower bounds for the complexity of finite semigroups
- Automata in algebra
- Pointlike sets with respect to R and J.
- Once more on the lattice of subvarieties of the wreath product of the variety of semilattices and the variety of semigroups with zero multiplication
- Homological dimension in semigroup algebras
- On decomposition of nonlinear control systems
- Endomorphism monoids of free acts and O-wreath products of monoids. I. Annihilator properties
- A generalization of the Schützenberger product of finite monoids
- The synthesis theorem for finite regular semigroups, and its generalization
- A tribute to John B. Fountain
- On classification of maximal nilpotent subsemigroups.
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- The idempotent-separating degree of a block-group.
- Projective indecomposable modules and quivers for monoid algebras
- Relationships between combinatorics and 0-simple semigroups
- Topology and monoid representations. I: Foundations
- On the Wilson monoid of a pairwise balanced design
- A note on series parallel irreducibility
- More on the descriptional complexity of products of finite automata
- Heights of one- and two-sided congruence lattices of semigroups
- On topological machines
- Notes on finitely generated semigroups and pumping conditions for regular languages
- A study of algebraic structures and logics based on categories of rough sets
- Decomposition techniques for finite semigroups, using categories. I
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
- On the semigroups of linear sequential machines
- Further results on monoids acting on trees.
- Financial laws as algebraic automata
- Remarks on algebraic decomposition of automata
- Generalized algebraic structures for the representation of discrete systems
- On the computational complexity of finite functions and semigroup multiplication
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)