Sur le produit de concatenation non ambigu
From MaRDI portal
Publication:1244582
Cites work
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 3522202 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 3287733 (Why is no real title available?)
- scientific article; zbMATH DE number 3308368 (Why is no real title available?)
- scientific article; zbMATH DE number 3353593 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Classification of noncounting events
- Decomposition and complexity of finite semigroups
- Existence of greatest decomposition of a semigroup
- 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
- On the greatest semilattice decomposition of a semigroup
- Recognizable languages and finite semilattices of groups
- Sur un algorithme donnant les codes bipréfixes finis
- The maximal semilattice decomposition of a semigroup
Cited in
(59)- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
- The amazing mixed polynomial closure and its applications to two-variable first-order logic
- Conelikes and ranker comparisons
- How many times do you need to go back to the future in unary temporal logic?
- All about unambiguous polynomial closure
- scientific article; zbMATH DE number 7533353 (Why is no real title available?)
- scientific article; zbMATH DE number 7269244 (Why is no real title available?)
- Pseudovarieties of ordered completely regular semigroups
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- Polynomial closure and unambiguous product
- Möbius functions and semigroup representation theory.
- On the irreducible representations of a finite semigroup
- SOME OPERATORS THAT PRESERVE THE LOCALITY OF A PSEUDOVARIETY OF SEMIGROUPS
- Programs over aperiodic monoids
- On the syntactic transformation semigroup of a language generated by a finite biprefix code
- Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words
- Cyclotomic polynomials and unions of groups
- Some complexity results for polynomial rational expressions.
- Periodic properties of groupbound semigroups. II
- Representations of the free profinite object over \(\mathbf{DA}\).
- A structural approach to the locality of pseudovarieties of the form \(\mathbf{LH}\circm\mathbf{V}\).
- Separating Without Any Ambiguity.
- Some results on the dot-depth hierarchy
- scientific article; zbMATH DE number 7350780 (Why is no real title available?)
- scientific article; zbMATH DE number 3905865 (Why is no real title available?)
- Measuring power of locally testable languages
- Varieties
- Two algebraic approaches to variants of the concatenation product
- Quivers of monoids with basic algebras.
- On ideal extensions of completely simple semigroups
- Compact semilattice quotients which separate idempotent J-classes
- On the Pin-Thérien expansion of idempotent monoids
- Unions of groups of small height
- On the lattice of sub-pseudovarieties of DA.
- Learning expressions and programs over monoids
- On fixed points of the lower set operator
- Polynomial closure of group languages and open sets of the Hall topology
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- Two-sided wreath product of categories
- scientific article; zbMATH DE number 7376042 (Why is no real title available?)
- ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM
- Some reducibility properties for pseudovarieties of the form \(DRH\)
- Locally trivial categories and unambiguous concatenation
- Polynomial closure and unambiguous product
- Polynomial operations and hierarchies of concatenation
- MONOIDS AND COMPUTATIONS
- On varieties of rational languages and variable-length codes
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- Matrix Mortality and the Černý-Pin Conjecture
- Sur les monoides dont tous les groupes sont resolubles
- Locality of DS and associated varieties
- Fragments of first-order logic over infinite words
- Omega-rational expressions with bounded synchronization delay
- An Algebraic Perspective on Boolean Function Learning
- The \(\kappa\)-word problem over \(\mathsf{DRH}\)
- THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS
- scientific article; zbMATH DE number 3724720 (Why is no real title available?)
- A generalization of the Schützenberger product of finite monoids
- Complexity of universality and related problems for partially ordered NFAs
This page was built for publication: Sur le produit de concatenation non ambigu
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244582)
