On the public citation graph

Bridges for concatenation hierarchies

https://doi.org/10.1007/bfb0055073
0 signed · 50 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-07407-4_23openalex-snapshot
Piecewise testable events
inferredcites →https://doi.org/10.1007/3-540-09118-1_27openalex-snapshot
Sur les varietes de langages et de monoïdes
inferredcites →https://doi.org/10.1007/3-540-56939-1_92openalex-snapshot
The product of rational languages
inferredcites →https://doi.org/10.1007/978-3-642-59136-5_10openalex-snapshot
Syntactic Semigroups
inferredcites →https://doi.org/10.1007/978-94-011-0149-3_2openalex-snapshot
BG = PG: A Success Story
inferredcites →https://doi.org/10.1007/bf02127803openalex-snapshot
Logic, semigroups and automata on words
inferredcites →https://doi.org/10.1007/bf02573578openalex-snapshot
Some results on the dot-depth hierarchy
inferredcites →https://doi.org/10.1007/bf02679467openalex-snapshot
Polynomial closure and unambiguous product
inferredcites →https://doi.org/10.1007/bfb0013106openalex-snapshot
Formal Properties of Finite Automata and Applications
inferredcites →https://doi.org/10.1007/bfb0013108openalex-snapshot
The wreath product and its applications
inferredcites →https://doi.org/10.1007/bfb0028813openalex-snapshot
Products of group languages
inferredcites →https://doi.org/10.1007/bfb0039607openalex-snapshot
Polynomial operations on rational languages
inferredcites →https://doi.org/10.1007/bfb0055037openalex-snapshot
On Existentially First-Order Definable Languages and Their Relation to NP
inferredcites →https://doi.org/10.1007/s002240000058openalex-snapshot
Polynomial Closure and Unambiguous Product
inferredcites →https://doi.org/10.1016/0022-0000(78)90049-1openalex-snapshot
The dot-depth hierarchy of star-free languages is infinite
inferredcites →https://doi.org/10.1016/0022-0000(82)90016-2openalex-snapshot
Classifying regular events in symbolic logic
inferredcites →https://doi.org/10.1016/0022-0000(92)90029-iopenalex-snapshot
Closure of varieties of languages under products with counter
inferredcites →https://doi.org/10.1016/0022-4049(79)90024-0openalex-snapshot
Families of recognizable sets corresponding to certain varieties of finite monoids
inferredcites →https://doi.org/10.1016/0022-4049(85)90062-3openalex-snapshot
Finite semigroup varieties of the form V ∗ D
inferredcites →https://doi.org/10.1016/0304-3975(81)90036-0openalex-snapshot
A generalization of the Schützenberger product of finite monoids
inferredcites →https://doi.org/10.1016/0304-3975(81)90057-8openalex-snapshot
Classification of finite monoids: the language approach
inferredcites →https://doi.org/10.1016/0304-3975(88)90034-5openalex-snapshot
Semigroups and languages of dot-depth two
inferredcites →https://doi.org/10.1016/0304-3975(91)90268-7openalex-snapshot
Opérations polynomiales et hiérarchies de concaténation
inferredcites →https://doi.org/10.1016/0304-3975(92)90121-uopenalex-snapshot
On a conjecture concerning dot-depth two languages
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1016/s0304-3975(96)00120-xopenalex-snapshot
Polynomial closure of group languages and open sets of the Hall topology
inferredcites →https://doi.org/10.1051/ita/197610r200331openalex-snapshot
Hierarchies of aperiodic languages
inferredcites →https://doi.org/10.1051/ita/1983170403211openalex-snapshot
A semigroup characterization of dot-depth one languages
inferredcites →https://doi.org/10.1051/ita/1983170403311openalex-snapshot
Some theorems on graph congruences
inferredcites →https://doi.org/10.1051/ita/1984180100231openalex-snapshot
Hiérarchies de concaténation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-44450-5_41openalex-snapshot
Decidable Hierarchies of Starfree Languages
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-642-21493-6_3openalex-snapshot
Theme and Variations on the Concatenation Product
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_29openalex-snapshot
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
inferred← citeshttps://doi.org/10.1007/s00224-007-9002-0openalex-snapshot
Languages of Dot-Depth 3/2
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/s0304-3975(01)00230-4openalex-snapshot
Algebraic tools for the concatenation product
inferred← citeshttps://doi.org/10.1051/ita:2001134openalex-snapshot
A conjecture on the concatenation product
inferred← citeshttps://doi.org/10.1051/ita:2005001openalex-snapshot
The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin
inferred← citeshttps://doi.org/10.1109/lics.2015.28openalex-snapshot
Separating Regular Languages with Two Quantifiers Alternations
inferred← citeshttps://doi.org/10.1109/lics.2017.8005070openalex-snapshot
Separation for dot-depth two
inferred← citeshttps://doi.org/10.1109/lics.2019.8785655openalex-snapshot
Separation and covering for group based concatenation hierarchies
inferred← citeshttps://doi.org/10.1142/s0218196702000912openalex-snapshot
PROFINITE METHODS IN SEMIGROUP THEORY
inferred← citeshttps://doi.org/10.1145/2815493.2815495openalex-snapshot
The tale of the quantifier alternation hierarchy of first-order logic over words
inferred← citeshttps://doi.org/10.1145/3303991openalex-snapshot
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
inferred← citeshttps://doi.org/10.23638/lmcs-14(4:16)2018openalex-snapshot
Separating regular languages with two quantifier alternations
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6832openalex-snapshot
Going higher in the First-order Quantifier Alternation Hierarchy on Words
inferred← citeshttps://doi.org/10.48550/arxiv.1904.11863openalex-snapshot
On all things star-free
inferred← citeshttps://doi.org/10.5555/3329995.3330005openalex-snapshot
Separation for dot-depth two
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.