On the public citation graph
An axiomatic approach to the Korenjak-Hopcroft algorithms
0 signed · 51 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/978-3-662-03563-4_4openalex-snapshot
Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1007/bf00263742openalex-snapshot
A system which automatically improves programs
inferredcites →https://doi.org/10.1007/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferredcites →https://doi.org/10.1007/bf01683280openalex-snapshot
Top-down tree transducers with regular look-ahead
inferredcites →https://doi.org/10.1007/bf01704020openalex-snapshot
Bottom-up and top-down tree transformations— a comparison
inferredcites →https://doi.org/10.1007/bf01744293openalex-snapshot
Infinite trees in normal form and recursive equations having a unique solution
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0304-3975(77)90016-0openalex-snapshot
A direct algorithm for checking equivalence of LL(k) grammars
inferredcites →https://doi.org/10.1016/0304-3975(78)90008-7openalex-snapshot
A representation of trees by languages I
inferredcites →https://doi.org/10.1016/0304-3975(78)90039-7openalex-snapshot
A representation of trees by languages II
inferredcites →https://doi.org/10.1016/0304-3975(79)90024-0openalex-snapshot
On equivalence of grammars through transformation trees
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/s0019-9958(80)90887-6openalex-snapshot
The equivalence problem for real-time strict deterministic languages
inferredcites →https://doi.org/10.1016/s0019-9958(81)90444-7openalex-snapshot
Equivalence problems for mappings on infinite strings
inferredcites →https://doi.org/10.1016/s0022-0000(73)80008-xopenalex-snapshot
Strict deterministic grammars
inferredcites →https://doi.org/10.1016/s0022-0000(76)80036-0openalex-snapshot
Completeness results for the equivalence of recursive schemas
inferredcites →https://doi.org/10.1016/s0022-0000(77)80019-6openalex-snapshot
Equivalence problems for deterministic context-free languages and monadic recursion schemes
inferredcites →https://doi.org/10.1051/ita/197408r100191openalex-snapshot
Une forme canonique pour les grammaires simples déterministes
inferredcites →https://doi.org/10.1145/321738.321750openalex-snapshot
Tree-Manipulating Systems and Church-Rosser Theorems
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11605157_7openalex-snapshot
Prime Normal Form and Equivalence of Simple Grammars
inferred← citeshttps://doi.org/10.1007/11779148_8openalex-snapshot
Equivalence of Functions Represented by Simple Context-Free Grammars with Output
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_11openalex-snapshot
A class of program schemes based on tree rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_63openalex-snapshot
Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_8openalex-snapshot
A fast algorithm to decide on simple grammars equivalence
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_51openalex-snapshot
On the transition graphs of automata and grammars
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_115openalex-snapshot
Branching bisimulation for context-free processes
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_221openalex-snapshot
The equivalence problem for deterministic pushdown automata is decidable
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferred← citeshttps://doi.org/10.1007/bf00288472openalex-snapshot
Synchronizable deterministic pushdown automata and the decidability of their equivalence
inferred← citeshttps://doi.org/10.1007/bf01178385openalex-snapshot
The extended equivalence problem for a class of non-real-time deterministic pushdown automata
inferred← citeshttps://doi.org/10.1007/bfb0035762openalex-snapshot
The definability of equational graphs in monadic second-order logic
inferred← citeshttps://doi.org/10.1007/bfb0055780openalex-snapshot
The equivalence problem for deterministic pushdown transducers into abelian groups
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90027-yopenalex-snapshot
The monadic second-order logic of graphs IV: definability properties of equational graphs11This work has been supported by the “Programme de Recherches Coordonnées: Mathématiques et Informatique”, and by the ESPRIT-Basic Research Action contract No. 3299, “Computing by graph transformations”.
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90026-4openalex-snapshot
An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90096-0openalex-snapshot
A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.021openalex-snapshot
Prime normal form and equivalence of simple grammars
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.01.011openalex-snapshot
Equivalence of simple functions
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90786-0openalex-snapshot
On the equivalence problem for attribute systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00285-1openalex-snapshot
L(A)=L(B)? decidability results from complete formal systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00027-0openalex-snapshot
L(A)=L(B)? A simplified decidability proof
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00106-1openalex-snapshot
Complete formal systems for equivalence problems
inferred← citeshttps://doi.org/10.1051/ita/1984180200911openalex-snapshot
Définitions récursives par cas
inferred← citeshttps://doi.org/10.1051/ita/1990240403391openalex-snapshot
Graphes canoniques de graphes algébriques
inferred← citeshttps://doi.org/10.1051/ita/1993270100231openalex-snapshot
A fast algorithm to decide on the equivalence of stateless DPDA
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743435openalex-snapshot
Decidability of bisimulation equivalence for equational graphs of finite out-degree
inferred← citeshttps://doi.org/10.1137/s0097539700377256openalex-snapshot
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
inferred← citeshttps://doi.org/10.1145/28869.28881openalex-snapshot
The equivalence problem for real-time DPDAs
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.