Sur le produit de concatenation non ambigu
From MaRDI portal
Publication:1244582
DOI10.1007/BF02194921zbMath0373.20059MaRDI QIDQ1244582
No author found.
Publication date: 1976
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/134196
Related Items (56)
Some complexity results for polynomial rational expressions. ⋮ On the Pin-Thérien expansion of idempotent monoids ⋮ Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words ⋮ Quivers of monoids with basic algebras ⋮ Polynomial closure of group languages and open sets of the Hall topology ⋮ Polynomial closure and unambiguous product ⋮ Locally trivial categories and unambiguous concatenation ⋮ Polynomial closure and unambiguous product ⋮ Two algebraic approaches to variants of the concatenation product ⋮ Locality of DS and associated varieties ⋮ Measuring power of locally testable languages ⋮ Some reducibility properties for pseudovarieties of the form DRH ⋮ Programs over aperiodic monoids ⋮ The \(\kappa\)-word problem over \(\mathsf{DRH}\) ⋮ Unnamed Item ⋮ Pseudovarieties of ordered completely regular semigroups ⋮ Conelikes and ranker comparisons ⋮ How many times do you need to go back to the future in unary temporal logic? ⋮ Unnamed Item ⋮ A generalization of the Schützenberger product of finite monoids ⋮ On varieties of rational languages and variable-length codes ⋮ Unnamed Item ⋮ On ideal extensions of completely simple semigroups ⋮ On the syntactic transformation semigroup of a language generated by a finite biprefix code ⋮ Compact semilattice quotients which separate idempotent J-classes ⋮ A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS ⋮ Unions of groups of small height ⋮ Separating Without Any Ambiguity. ⋮ Two-sided wreath product of categories ⋮ Polynomial operations and hierarchies of concatenation ⋮ A STRUCTURAL APPROACH TO THE LOCALITY OF PSEUDOVARIETIES OF THE FORM LH ⓜ V ⋮ ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM ⋮ Möbius functions and semigroup representation theory. II: Character formulas and multiplicities. ⋮ Unnamed Item ⋮ MONOIDS AND COMPUTATIONS ⋮ Some results on the dot-depth hierarchy ⋮ Fragments of first-order logic over infinite words ⋮ SOME OPERATORS THAT PRESERVE THE LOCALITY OF A PSEUDOVARIETY OF SEMIGROUPS ⋮ Learning expressions and programs over monoids ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ Unnamed Item ⋮ On the lattice of sub-pseudovarieties of DA. ⋮ Möbius functions and semigroup representation theory. ⋮ Representation theory of finite semigroups, semigroup radicals and formal language theory ⋮ Cyclotomic polynomials and unions of groups ⋮ THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS ⋮ Matrix Mortality and the Černý-Pin Conjecture ⋮ REPRESENTATIONS OF THE FREE PROFINITE OBJECT OVER DA ⋮ On the irreducible representations of a finite semigroup ⋮ Unnamed Item ⋮ An Algebraic Perspective on Boolean Function Learning ⋮ Varieties ⋮ Periodic properties of groupbound semigroups. II ⋮ Sur les monoides dont tous les groupes sont resolubles ⋮ On fixed points of the lower set operator ⋮ Omega-rational expressions with bounded synchronization delay
Cites Work
- Recognizable languages and finite semilattices of groups
- Decomposition and complexity of finite semigroups
- Classification of noncounting events
- Global structure theories for finite semigroups. Introduction. I: Extension of the fundamental theorem of finite semigroups. II: Axioms for complexity for all finite semigroups. III: Complexity of two-\(J\) class semigroups. IV: Synthesis of the classical and modern theory of finite semigroups
- Existence of greatest decomposition of a semigroup
- Sur un algorithme donnant les codes bipréfixes finis
- On the greatest semilattice decomposition of a semigroup
- The maximal semilattice decomposition of a semigroup
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sur le produit de concatenation non ambigu
