scientific article; zbMATH DE number 3287733

zbMATH Open0181.01501MaRDI QIDQ5570933FDOQ5570933

Authors: Michael A. Arbib

Publication date: 1968

Title of this publication is not available (Why is that?)

zbMATH Keywords

languages, automata, networks

Cited In (only showing first 100 items - show all)

CAYLEY AUTOMATON SEMIGROUPS
ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
The group-theoretic complexity of subsemigroups of Boolean matrices
Infinite-vertex free profinite semigroupoids and symbolic dynamics.
On multisemigroups.
Improved lower bounds for the complexity of finite semigroups
On decomposition of nonlinear control systems
On the irreducible representations of a finite semigroup
On residual finiteness of monoids, their Schützenberger groups and associated actions.
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)
Iteration of expansions. Unambiguous semigroups
Subgroups of free idempotent generated semigroups need not be free.
On subsystems of a fuzzy finite state machine
The complexity of economic decision rules
Structure of subsemigroups of factor-powers of finite symmetric groups
Sur le produit de concatenation non ambigu
On the cohomology of finite semigroups
Inverse semigroups and extensions of groups by semilattices
On classification of maximal nilpotent subsemigroups.
Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC
Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
The global dimension of the full transformation monoid (with an appendix by V. Mazorchuk and B. Steinberg)
Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
Almost finite expansions of arbitrary semigroups
An Improved Upper Bound for Global Dimension of Semigroup Algebras
SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
On the fixpoints of monogenic functions in free monoids
On a characterization of the nonregular set of primes
Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets
Blocking of group automata. II: Mutual interlocking.
Infinite iteration of matrix semigroups. I: Structure theorem for torsion semigroups
On effectively computable realizations of choice functions
Non-uniform automata over groups
Pointlike sets with respect to R and J.
Endomorphism monoids of free acts and O-wreath products of monoids. I. Annihilator properties
A tribute to John B. Fountain
Groups acting on semimetric spaces and quasi-isometries of monoids.
On the complexity of finite semigroups
Acts over semigroups
On approximation of locally compact groups by finite algebraic systems
Cascade connections and triangular products of linear automata
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.
ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES
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
A generalization of the Schützenberger product of finite monoids
Title not available (Why is that?)
Completeness and the finite model property for Kleene algebra, reconsidered
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
Complete classes of automata for the \(\alpha _ 0\)-product
On finite 0-simple semigroups and graph theory
Locally testable semigroups
Some contributions to the theory of transformation monoids
Relationship between combinatorics and O-simple semigroups
The idempotent-separating degree of a block-group.
Blocking of group automata. I: One-sided interlocking
Finite semigroup varieties of the form V*D
Locally testable languages
Homological dimension in semigroup algebras
Pointlike sets: the finest aperiodic cover of a finite semigroup
Partially ordered finite monoids and a theorem of I. Simon
On \(\alpha{}_ 0-\nu{}_ 1\)-products of automata
Representation theory of finite semigroups over semirings.
Self-automaton semigroups.
Automata in algebra
Dot-depth of star-free events
The synthesis theorem for finite regular semigroups, and its generalization
A generalization of the Rees theorem to a class of regular semigroups
COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS
COMPLEXITY AND INFORMATION TECHNOLOGY IN DYNAMIC SYSTEMS
Unified theory for finite Markov chains
Operators and products in the lattice of existence varieties of regular semigroups
Complete endomorphisms of the lattice of pseudovarieties of finite semigroups
Green index in semigroups: generators, presentations, and automatic structures.
Generalized algebraic structures for the representation of discrete systems
Representations of relatively free profinite semigroups, irreducibility, and order primitivity
Isomorphisms of wreath products of monoids. I
On \(\alpha _ 0\)-products and \(\alpha _ 2\)-products
Significance arithmetic: The probability of carrying
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.
A note on series parallel irreducibility
John Rhodes and the theory of finite semigroups.
Lower bounds for complexity of finite semigroups
Book review of: J. Rhodes and B. Steinberg, The \(\mathfrak q\)-theory of finite semigroups
Representations of Semigroups and the Translational Hull of a Regular Rees Matrix Semigroup
A new proof of the Krohn-Rhodes theorem for transformation semigroups
Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case
Remarks on algebraic decomposition of automata
Algebraic representations for finite-state machines. II: Module formulation
Product expansions

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)