On the public citation graph
Nonfinite axiomatizability of the equational theory of shuffle
0 signed · 30 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.1006/inco.1993.1019openalex-snapshot
Towards Action-Refinement in Process Algebras
inferredcites →https://doi.org/10.1006/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferredcites →https://doi.org/10.1007/3-540-53982-4_1openalex-snapshot
Full abstraction for series-parallel pomsets
inferredcites →https://doi.org/10.1007/3-540-59293-8_204openalex-snapshot
Nonfinite axiomatizability of shuffle inequalities
inferredcites →https://doi.org/10.1007/3-540-60084-1_60openalex-snapshot
Nonfinite axiomatizability of the equational theory of shuffle
inferredcites →https://doi.org/10.1007/bfb0032072openalex-snapshot
The importance of the left merge operator in process algebras
inferredcites →https://doi.org/10.1016/0304-3975(91)90395-iopenalex-snapshot
Complete systems ofB-rational identities
inferredcites →https://doi.org/10.1016/0304-3975(95)00230-8openalex-snapshot
Free shuffle algebras in language varieties
inferredcites →https://doi.org/10.1016/s0022-0000(76)80030-xopenalex-snapshot
Varieties of ordered algebras
inferredcites →https://doi.org/10.1017/s0960129500000104openalex-snapshot
Equational axioms for regular sets
inferredcites →https://doi.org/10.1017/s0960129500000578openalex-snapshot
Languages under concatenation and shuffling
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/0406035openalex-snapshot
Complexity Results for POMSET Languages
inferredcites →https://doi.org/10.1145/321312.321326openalex-snapshot
Two Complete Axiom Systems for the Algebra of Regular Events
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_21openalex-snapshot
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_15openalex-snapshot
Quotients of Unbounded Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_2openalex-snapshot
The Saga of the Axiomatization of Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_10openalex-snapshot
Recognizing Shuffled Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_4openalex-snapshot
Some Results of Zoltán Ésik on Regular Languages
inferred← citeshttps://doi.org/10.1007/s00236-010-0114-7openalex-snapshot
Lifting non-finite axiomatizability results to extensions of process algebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.076openalex-snapshot
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.003openalex-snapshot
CCS with Hennessy's merge has no finite-equational axiomatization
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.022openalex-snapshot
Shuffled languages—Representation and recognition
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00236-0openalex-snapshot
The max-plus algebra of the natural numbers has no finite equational basis
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00277-7openalex-snapshot
Shuffle and scattered deletion closure of languages
inferred← citeshttps://doi.org/10.14232/actacyb.23.1.2017.23openalex-snapshot
Publication List of Zoltán Ésik
inferred← citeshttps://doi.org/10.14232/actacyb.23.1.2017.6openalex-snapshot
Trace Simulation Semantics is not Finitely Based over BCCSP
inferred← citeshttps://doi.org/10.7146/brics.v10i34.21802openalex-snapshot
CCS with Hennessy's Merge has no Finite Equational Axiomatization
inferred← citeshttps://doi.org/10.7146/brics.v14i11.21933openalex-snapshot
The Saga of the Axiomatization of Parallel Composition
inferred← citeshttps://doi.org/10.7146/brics.v6i33.20102openalex-snapshot
The Max-Plus Algebra of the Natural Numbers has no Finite Equational Basis
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.