On the public citation graph

Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes

https://doi.org/10.1007/11821069_56
0 signed · 29 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.1006/inco.1995.1129openalex-snapshot
Bisimulation Equivalence Is Decidable for All Context-Free Processes
inferredcites →https://doi.org/10.1007/11605157_7openalex-snapshot
Prime Normal Form and Equivalence of Simple Grammars
inferredcites →https://doi.org/10.1007/3-540-17945-3_5openalex-snapshot
Decidability of bisimulation equivalence for processes generating context-free languages
inferredcites →https://doi.org/10.1007/3-540-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferredcites →https://doi.org/10.1007/bfb0039066openalex-snapshot
The linear time - branching time spectrum
inferredcites →https://doi.org/10.1007/bfb0049431openalex-snapshot
Testing equivalence of morphisms on context-free languages
inferredcites →https://doi.org/10.1016/0304-3975(76)90074-8openalex-snapshot
The inclusion problem for simple languages
inferredcites →https://doi.org/10.1016/0304-3975(92)00078-6openalex-snapshot
Deciding bisimilarity of normed context-free processes is in Σp2
inferredcites →https://doi.org/10.1016/0304-3975(95)00064-xopenalex-snapshot
A polynomial algorithm for deciding bisimilarity of normed context-free processes
inferredcites →https://doi.org/10.1016/j.tcs.2006.07.021openalex-snapshot
Prime normal form and equivalence of simple grammars
inferredcites →https://doi.org/10.1016/s0019-9958(68)90251-9openalex-snapshot
File organization schemes based on finite geometries
inferredcites →https://doi.org/10.1109/lics.1991.151661openalex-snapshot
Actions speak louder than words: proving bisimilarity for context-free processes
inferredcites →https://doi.org/10.1109/swat.1966.22openalex-snapshot
Simple deterministic languages

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-3-540-73437-6_24openalex-snapshot
Processing Compressed Texts: A Tractability Border
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_34openalex-snapshot
Normed BPA vs. Normed BPP Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_4openalex-snapshot
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_26openalex-snapshot
Unification with Singleton Tree Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_18openalex-snapshot
Partially-Commutative Context-Free Processes
inferred← citeshttps://doi.org/10.1007/s00224-013-9443-6openalex-snapshot
The Complexity of Compressed Membership Problems for Finite Automata
inferred← citeshttps://doi.org/10.1016/j.ic.2009.10.012openalex-snapshot
Complexity of deciding bisimilarity between normed BPA and normed BPP
inferred← citeshttps://doi.org/10.1016/j.ic.2010.12.003openalex-snapshot
Partially-commutative context-free processes: Expressibility and tractability
inferred← citeshttps://doi.org/10.1109/lics.2015.26openalex-snapshot
Branching Bisimilarity on Normed BPA Is EXPTIME-Complete
inferred← citeshttps://doi.org/10.1142/s0129054113500068openalex-snapshot
A NOTE ON LIMITED PUSHDOWN ALPHABETS IN STATELESS DETERMINISTIC PUSHDOWN AUTOMATA
inferred← citeshttps://doi.org/10.1145/1970398.1970402openalex-snapshot
Unification and matching on compressed terms
inferred← citeshttps://doi.org/10.1145/3689748openalex-snapshot
Programmable MCMC with Soundly Composed Guide Programs
inferred← citeshttps://doi.org/10.1515/gcc-2012-0016openalex-snapshot
Algorithmics on SLP-compressed strings: A survey
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.260openalex-snapshot
Fast equivalence-checking for normed context-free processes
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.136openalex-snapshot
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)
inferred← citeshttps://doi.org/10.48550/arxiv.1411.4157openalex-snapshot
A Polynomial Time Algorithm for Deciding Branching Bisimilarity on Totally Normed BPA
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.