On the public citation graph
Sur Le Produit De Concatenation Non Ambigu
0 signed · 129 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01114879openalex-snapshot
The maximal semilattice decomposition of a semigroup
inferredcites →https://doi.org/10.1007/bf01706090openalex-snapshot
Sur un algorithme donnant les codes bipréfixes finis
inferredcites →https://doi.org/10.1007/bf02195268openalex-snapshot
Recognizable languages and finite semilattices of groups
inferredcites →https://doi.org/10.1007/bf02570795openalex-snapshot
Note on the greatest semilattice decomposition of semigroups
inferredcites →https://doi.org/10.1007/bf02572961openalex-snapshot
Decomposition and complexity of finite semigroups
inferredcites →https://doi.org/10.1016/0001-8708(73)90009-1openalex-snapshot
Chapter 3. Complexity of two-J class semigroups
inferredcites →https://doi.org/10.1016/0001-8708(73)90010-8openalex-snapshot
Chapter 4. Synthesis of the classical and modern theory of finite semigroups
inferredcites →https://doi.org/10.1016/0304-3975(76)90063-3openalex-snapshot
Regular semigroups with D = R as syntactic monoids of prefix codes
inferredcites →https://doi.org/10.1016/s0022-0000(71)80006-5openalex-snapshot
Classification of noncounting events
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.2996/kmj/1138843610openalex-snapshot
On the greatest semilattice decomposition of a semigroup
inferredcites →https://doi.org/10.2996/kmj/1138843636openalex-snapshot
Existence of greatest decomposition of a semigroup
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11523468_35openalex-snapshot
Groupoids That Recognize Only Regular Languages
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_81openalex-snapshot
On the Theory of Syntactic Monoids for Rational Languages
inferred← citeshttps://doi.org/10.1007/3-540-08848-2_16openalex-snapshot
Some applications of the theory of semigroups to automata
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_25openalex-snapshot
Une caracterisation de trois varietes de langages bien connues
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_93openalex-snapshot
Proprietes syntactiques du produit non ambigu
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_30openalex-snapshot
Algebraic Characterizations of Small Classes of Boolean Functions
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_47openalex-snapshot
Satisfiability of Systems of Equations over Finite Monoids
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_25openalex-snapshot
Learning Expressions over Monoids
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_48openalex-snapshot
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_13openalex-snapshot
Weakly Iterated Block Products of Finite Monoids
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_20openalex-snapshot
Partially-Ordered Two-Way Automata: A New Characterization of DA
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_3openalex-snapshot
Classifying Discrete Temporal Properties
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_99openalex-snapshot
On varieties of languages closed under products with counter
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_87openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_31openalex-snapshot
Marking the chops: an unambiguous temporal logic
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_6openalex-snapshot
Deciding Classes of Regular Languages: The Covering Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_15openalex-snapshot
Deciding FO2 Alternation for Automata over Finite and Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_22openalex-snapshot
Measuring Power of Locally Testable Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_22openalex-snapshot
Conelikes and Ranker Comparisons
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_25openalex-snapshot
How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?
inferred← citeshttps://doi.org/10.1007/978-3-031-97100-6_12openalex-snapshot
Relative Densities of Formal Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_3openalex-snapshot
Asymptotic Reasoning With Two Variables
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_3openalex-snapshot
Seventy Years of Algebraic, Logical, and Topological Methods for Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_24openalex-snapshot
From Algebra to Logic: There and Back Again The Story of a Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_8openalex-snapshot
Algebraic Recognizability of Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_5openalex-snapshot
Regular Languages, Unambiguous Concatenation and Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_8openalex-snapshot
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_1openalex-snapshot
On First-Order Fragments for Words and Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_27openalex-snapshot
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_5openalex-snapshot
Matrix Mortality and the Černý-Pin Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_19openalex-snapshot
An Algebraic Perspective on Boolean Function Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_15openalex-snapshot
Rankers over Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_14openalex-snapshot
Unambiguity in Timed Regular Languages: Automata and Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_3openalex-snapshot
Theme and Variations on the Concatenation Product
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_53openalex-snapshot
The Join Levels of the Trotter-Weil Hierarchy Are Decidable
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_5openalex-snapshot
An Explicit Formula for the Intersection of Two Polynomials of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_18openalex-snapshot
Deterministic Logics for UL
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_64openalex-snapshot
Separating Regular Languages by Piecewise Testable and Unambiguous Languages
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_1openalex-snapshot
Finite Semigroups and Recognizable Languages: An Introduction
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_4openalex-snapshot
Relatively Free Profinite Monoids: An Introduction and Examples
inferred← citeshttps://doi.org/10.1007/bf02572769openalex-snapshot
On ideal extensions of completely simple semigroups
inferred← citeshttps://doi.org/10.1007/bf02572777openalex-snapshot
Compact semilattice quotients which separate idempotent ℐ-classes
inferred← citeshttps://doi.org/10.1007/bf02572813openalex-snapshot
On M-varieties generated by power monoids
inferred← citeshttps://doi.org/10.1007/bf02572822openalex-snapshot
Sur les monoides dont tous les groupes sont résolubles
inferred← citeshttps://doi.org/10.1007/bf02572834openalex-snapshot
Periodic properties of groupbound semigroups II
inferred← citeshttps://doi.org/10.1007/bf02573494openalex-snapshot
On the Pin-Thérien expansion of idempotent monoids
inferred← citeshttps://doi.org/10.1007/bf02573578openalex-snapshot
Some results on the dot-depth hierarchy
inferred← citeshttps://doi.org/10.1007/bf02679467openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/bf03546065openalex-snapshot
Obituary - Marcel-Paul Schützenberger (1920–1996)
inferred← citeshttps://doi.org/10.1007/bfb0039607openalex-snapshot
Polynomial operations on rational languages
inferred← citeshttps://doi.org/10.1007/pl00005974openalex-snapshot
Operators on the Lattice of Pseudovarieties of Finite Semigroups
inferred← citeshttps://doi.org/10.1007/s00025-019-0998-7openalex-snapshot
Pseudovarieties of Ordered Completely Regular Semigroups
inferred← citeshttps://doi.org/10.1007/s00224-010-9266-7openalex-snapshot
Fragments of First-Order Logic over Infinite Words
inferred← citeshttps://doi.org/10.1007/s00224-013-9526-4openalex-snapshot
Omega-Rational Expressions with Bounded Synchronization Delay
inferred← citeshttps://doi.org/10.1007/s00233-004-0117-1openalex-snapshot
Regular Subsets of Semigroups Related to their Idempotents
inferred← citeshttps://doi.org/10.1007/s00233-010-9258-6openalex-snapshot
On the lattice of sub-pseudovarieties of DA
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90170-xopenalex-snapshot
Cyclotomic polynomials and unions of groups
inferred← citeshttps://doi.org/10.1016/0022-4049(82)90005-6openalex-snapshot
On varieties of rational languages and variable-length codes
inferred← citeshttps://doi.org/10.1016/0022-4049(82)90026-3openalex-snapshot
Unions of groups of small height
inferred← citeshttps://doi.org/10.1016/0022-4049(88)90097-7openalex-snapshot
Locally trivial categories and unambiguous concatenation
inferred← citeshttps://doi.org/10.1016/0022-4049(91)90119-mopenalex-snapshot
Two-sided wreath product of categories
inferred← citeshttps://doi.org/10.1016/0022-4049(94)00054-9openalex-snapshot
Locality of DS and associated varieties
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90036-0openalex-snapshot
A generalization of the Schützenberger product of finite monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90051-0openalex-snapshot
Programs over aperiodic monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90085-6openalex-snapshot
On the syntactic transformation semigroup of a language generated by a finite biprefix code
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90268-7openalex-snapshot
Opérations polynomiales et hiérarchies de concaténation
inferred← citeshttps://doi.org/10.1016/j.aim.2007.12.001openalex-snapshot
Möbius functions and semigroup representation theory II: Character formulas and multiplicities
inferred← citeshttps://doi.org/10.1016/j.ic.2005.09.003openalex-snapshot
Learning expressions and programs over monoids
inferred← citeshttps://doi.org/10.1016/j.ic.2017.06.004openalex-snapshot
Complexity of universality and related problems for partially ordered NFAs
inferred← citeshttps://doi.org/10.1016/j.jcta.2005.08.004openalex-snapshot
Möbius functions and semigroup representation theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.09.017openalex-snapshot
Two algebraic approaches to variants of the concatenation product
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.008openalex-snapshot
The κ-word problem over DRH
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00342-5openalex-snapshot
Some complexity results for polynomial rational expressions
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00120-xopenalex-snapshot
Polynomial closure of group languages and open sets of the Hall topology
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00027-9openalex-snapshot
List of publications of Marcel-Paul Schützenberger
inferred← citeshttps://doi.org/10.1017/s1446788718000010openalex-snapshot
ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM
inferred← citeshttps://doi.org/10.1051/ita/1981150201491openalex-snapshot
Relational morphisms and operations on recognizable sets
inferred← citeshttps://doi.org/10.1051/ita/1985190201651openalex-snapshot
Construction de codes indécomposables
inferred← citeshttps://doi.org/10.1051/ita/2013039openalex-snapshot
New applications of the wreath product of forest algebras
inferred← citeshttps://doi.org/10.1070/sm1995v082n02abeh003577openalex-snapshot
ON THE THEORY OF EPIGROUPS. I
inferred← citeshttps://doi.org/10.1080/00927872.2017.1360328openalex-snapshot
Some reducibility properties for pseudovarieties of the formDRH
inferred← citeshttps://doi.org/10.1090/s0002-9939-09-09857-8openalex-snapshot
On the irreducible representations of a finite semigroup
inferred← citeshttps://doi.org/10.1090/s0002-9947-08-04712-0openalex-snapshot
Representation theory of finite semigroups, semigroup radicals and formal language theory
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00031openalex-snapshot
Navigational hierarchies of regular languages
inferred← citeshttps://doi.org/10.1112/s0010437x1200022xopenalex-snapshot
Quivers of monoids with basic algebras
inferred← citeshttps://doi.org/10.1137/22m1512612openalex-snapshot
Decidability of Membership Problems for Flat Rational Subsets of \(\boldsymbol{{\textrm{GL}}(2,\boldsymbol{{\mathbb{Q}}})}\) and Singular Matrices
inferred← citeshttps://doi.org/10.1142/s0129054105003200openalex-snapshot
THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS
inferred← citeshttps://doi.org/10.1142/s0129054108005802openalex-snapshot
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
inferred← citeshttps://doi.org/10.1142/s0218196710005674openalex-snapshot
A STRUCTURAL APPROACH TO THE LOCALITY OF PSEUDOVARIETIES OF THE FORM LH ⓜ V
inferred← citeshttps://doi.org/10.1142/s0218196711006467openalex-snapshot
REPRESENTATIONS OF THE FREE PROFINITE OBJECT OVER DA
inferred← citeshttps://doi.org/10.1142/s0218196713500112openalex-snapshot
SOME OPERATORS THAT PRESERVE THE LOCALITY OF A PSEUDOVARIETY OF SEMIGROUPS
inferred← citeshttps://doi.org/10.1142/s021819671540010xopenalex-snapshot
On fixed points of the lower set operator
inferred← citeshttps://doi.org/10.1145/276698.276749openalex-snapshot
Over words, two variables are as powerful as one quantifier alternation
inferred← citeshttps://doi.org/10.1145/2933575.2935308openalex-snapshot
Two-variable Logic with a Between Relation
inferred← citeshttps://doi.org/10.1145/3149822openalex-snapshot
An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic
inferred← citeshttps://doi.org/10.1145/3303991openalex-snapshot
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
inferred← citeshttps://doi.org/10.1145/3531130.3532410openalex-snapshot
The amazing mixed polynomial closure and its applications to two-variable first-order logic
inferred← citeshttps://doi.org/10.2168/lmcs-3(1:4)2007openalex-snapshot
Logic Meets Algebra: the Case of Regular Languages
inferred← citeshttps://doi.org/10.2168/lmcs-5(3:4)2009openalex-snapshot
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:16)2020openalex-snapshot
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:14)2021openalex-snapshot
Partially Ordered Automata and Piecewise Testability
inferred← citeshttps://doi.org/10.25596/jalc-2002-247openalex-snapshot
The Computing Power of Programs over Finite Monoids
inferred← citeshttps://doi.org/10.3233/fi-2012-666openalex-snapshot
On the Shuffle of Star-Free Languages
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.305openalex-snapshot
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable
inferred← citeshttps://doi.org/10.48550/arxiv.1204.4672openalex-snapshot
The Join Levels of the Trotter-Weil Hierarchy are Decidable
inferred← citeshttps://doi.org/10.48550/arxiv.1505.03343openalex-snapshot
Zero-One Law for Regular Languages and Semigroups with Zero
inferred← citeshttps://doi.org/10.48550/arxiv.1707.04441openalex-snapshot
Non-locality of the meet levels of the Trotter-Weil Hierarchy
inferred← citeshttps://doi.org/10.48550/arxiv.2008.11635openalex-snapshot
Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic
inferred← citeshttps://doi.org/10.48550/arxiv.2012.01309openalex-snapshot
Nesting negations in FO2 over infinite words
inferred← citeshttps://doi.org/10.48550/arxiv.math/0612498openalex-snapshot
A structural approach to the locality of pseudovarieties of the form $\mathbf{LH} m \mathbf{V}$
inferred← citeshttps://doi.org/10.70675/103d5ffaz8ac1z4734z8baez06115519a946openalex-snapshot
Définissabilité et synthèse de transductions
inferred← citeshttps://doi.org/10.70675/412a4333z5867z452fz9404z271549351d1dopenalex-snapshot
The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.