On the public citation graph
Products of group languages
0 signed · 39 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/3-540-09118-1_27openalex-snapshot
Sur les varietes de langages et de monoïdes
inferredcites →https://doi.org/10.1007/3-540-13345-3_30openalex-snapshot
Languages and inverse semigroups
inferredcites →https://doi.org/10.1007/bf02572755openalex-snapshot
Decidability of complexity one-half for finite semigroups
inferredcites →https://doi.org/10.1007/bf02574198openalex-snapshot
Recognizable sets and power sets of finite semigroups
inferredcites →https://doi.org/10.1016/0022-4049(79)90025-2openalex-snapshot
Aperiodic homomorphisms and the concatenation product of recognizable sets
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.1051/ita/1984180100231openalex-snapshot
Hiérarchies de concaténation
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
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-18088-5_19openalex-snapshot
On the languages accepted by finite reversible automata
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_87openalex-snapshot
Polynomial closure of group languages and open sets of the Hall topology
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_87openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_20openalex-snapshot
Characterizing Level One in Group-Based Concatenation Hierarchies
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-58747-9_5openalex-snapshot
Concatenation Hierarchies: New Bottle, Old Wine
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/bf02573090openalex-snapshot
A property of the Schützenberger product
inferred← citeshttps://doi.org/10.1007/bf02679467openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/bfb0031393openalex-snapshot
Precise estimation of the order of local testability of a deterministic finite automaton
inferred← citeshttps://doi.org/10.1007/bfb0055073openalex-snapshot
Bridges for concatenation hierarchies
inferred← citeshttps://doi.org/10.1007/s00236-025-00519-6openalex-snapshot
Sweeping permutation automata
inferred← citeshttps://doi.org/10.1016/0022-4049(92)90148-9openalex-snapshot
New results on the conjecture of Rhodes and on the topological conjecture
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114489openalex-snapshot
GF(2)-operations on basic families of formal languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00230-4openalex-snapshot
Algebraic tools for the concatenation product
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.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.2019.8785655openalex-snapshot
Separation and covering for group based concatenation hierarchies
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00031openalex-snapshot
Navigational hierarchies of regular languages
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/s0218196724500024openalex-snapshot
The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
inferred← citeshttps://doi.org/10.12677/pm.2016.62013openalex-snapshot
A Note on the Definitions of Blocks of Epigroups
inferred← citeshttps://doi.org/10.48550/arxiv.2011.06253openalex-snapshot
Precise estimation on the order of local testability of deterministic finite automaton
inferred← citeshttps://doi.org/10.70675/22dd7305zb552z431fza392zbc8e233f69dfopenalex-snapshot
Induction Schemes : From Language Separation to Graph Colorings
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.