scientific article
From MaRDI portal
Publication:3853827
zbMath0421.20025MaRDI QIDQ3853827
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Green's relationsfree semigroupsword problemcompletely 0-simple semigroupstransformation semigroupcontext-free languagesMacMahon's master theoremcodeslanguagesSchützenberger groupsBurnside problemsyntactic monoidsalgebraic theory of automataalgebraic linguisticsrational prefix codes
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Research exposition (monographs, survey articles) pertaining to group theory (20-02) Semigroups (20Mxx)
Related Items (only showing first 100 items - show all)
On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups ⋮ Graded algebras, algebraic functions, planar trees, and elliptic integrals ⋮ The fractal nature of folds and the Walsh copolymers ⋮ Presentations for monoids of finite partial isometries ⋮ The finite basis problem for words with at most two non-linear variables. ⋮ Factorization forests for infinite words and applications to countable scattered linear orderings ⋮ Fuzzy submonoids, fuzzy preorders and quasi-metrics ⋮ On the 3-state Mealy automata over an \(m\)-symbol alphabet of growth order \([n^{\log n/2\log m}\).] ⋮ Semigroup theory of symmetry ⋮ A geometric characterization of automatic semigroups ⋮ An algorithmic approach to the problem of a semiretract base ⋮ Decidable sentences of Church-Rosser congruences ⋮ The varieties of n-testable semigroups ⋮ The Möbius function on abelian semigroups. ⋮ On disjoint unions of finitely many copies of the free monogenic semigroup. ⋮ On the maximality of languages with combined types of code properties ⋮ On residual finiteness of monoids, their Schützenberger groups and associated actions. ⋮ Graph inverse semigroups: their characterization and completion. ⋮ A classification of disjoint unions of two or three copies of the free monogenic semigroup. ⋮ Factorization forests of finite height ⋮ Graph products of spheres, associative graded algebras and Hilbert series. ⋮ Soliton automata ⋮ Cancellation in semigroups in which \(x^ 2=x^ 3\) ⋮ Solid codes and disjunctive domains ⋮ Groups and decompositions of codes ⋮ Decision problems for finite special string-rewriting systems that are confluent on some congruence class ⋮ Recent results on syntactic groups of prefix codes. ⋮ On the varieties of languages associated with some varieties of finite monoids with commuting idempotents ⋮ f-disjunctive congruences and a generalization of monoids with length ⋮ Products of languages with counter ⋮ A correspondence between a class of monoids and self-similar group actions. I. ⋮ On group codes ⋮ \(\mathbb{N}\)-rationality of zeta functions ⋮ On the decomposition of prefix codes ⋮ Decompositions of recognizable strong maximal codes ⋮ Groups of finite elementary codes ⋮ Locally commutative power semigroups and counting factors of words ⋮ Green index and finiteness conditions for semigroups. ⋮ Structure of prime finitely presented monomial algebras. ⋮ Range sets and partition sets in connection with congruences and algebraic invariants ⋮ Adjan's theorem and conjugacy in semigroups ⋮ Equations and dot-depth one ⋮ Languages with membership determined by single letter factors ⋮ Weighted automata with discounting ⋮ Supertropical matrix algebra ⋮ Bilateral semidirect product decompositions of transformation monoids. ⋮ Semigroup identities in the monoid of two-by-two tropical matrices. ⋮ On properties not inherited by monoids from their Schützenberger groups. ⋮ A note on autodense related languages ⋮ On the groups of codes with empty kernel. ⋮ Inverse semigroups and extensions of groups by semilattices ⋮ Inverse semigroups and varieties of finite semigroups ⋮ Linear semigroups with permutation properties ⋮ Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism ⋮ On monomial algebras ⋮ A note on F-disjunctive languages ⋮ On a constant word in finite semigroups ⋮ Infinite-vertex free profinite semigroupoids and symbolic dynamics. ⋮ Regular autodense languages ⋮ Semigroup presentations for test local groups. ⋮ Intersection graphs of \(S\)-acts ⋮ On three approaches to conjugacy in semigroups. ⋮ On finitely generated idempotent semigroups. ⋮ Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group ⋮ Generalized affine transformation monoid of a free module of finite rank over finite chain rings. ⋮ Compositions of maximal codes ⋮ The applications of solid codes to r-R and r-D languages ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ Semigroups for which every right congruence of finite index is finitely generated ⋮ Green's relations and stability for subsemigroups ⋮ On semidirect products of two finite semilattices ⋮ L codes and number systems ⋮ A combinatorial proof of the Cayley-Hamilton theorem ⋮ Realisation locale des systèmes non linéaires, algèbres de Lie filtrees transitives et séries generatrices non commutatives ⋮ On M-varieties generated by power monoids ⋮ On the centers of a language ⋮ Translational hulls and block designs ⋮ Some algorithms on the star operation applied to finite languages ⋮ A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages ⋮ Some undecidability results for non-monadic Church-Rosser Thue systems ⋮ Inversion of matrices over a commutative semiring ⋮ Power monoids and finite J-trivial monoids ⋮ An application of the matrix representation of transductions ⋮ The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids ⋮ Code properties and homomorphisms of DOL systems ⋮ Almost finite expansions of arbitrary semigroups ⋮ Iteration of expansions. Unambiguous semigroups ⋮ Arbitrary vs. regular semigroups ⋮ Biprefix codes, inverse semigroups and syntactic monoids of injective automata ⋮ Partial commutations and faithful rational transductions ⋮ Conjugacy in monoids with a special Church-Rosser presentation is decidable ⋮ The groups of the semigroup of compact subsets of a topological group ⋮ Quelques propriétés des systèmes générateurs minimaux des monoides. (Some properties of minimal generating systems of monoids) ⋮ Non-uniform automata over groups ⋮ On the expressive power of temporal logic for infinite words ⋮ Sequential machines realized by group representations ⋮ Test sets for morphisms with bounded delay ⋮ Some properties of commutation in free partially commutative monoids ⋮ On finitely recognizable semigroups ⋮ Diagram groups and directed 2-complexes: homotopy and homology.
This page was built for publication:
