On the public citation graph
Polynomial Size Test Sets For Context-Free Languages
0 signed · 20 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-18088-5_12openalex-snapshot
On recent trends in formal language theory
inferredcites →https://doi.org/10.1007/3-540-55719-9_63openalex-snapshot
Polynomial size test sets for context-free languages
inferredcites →https://doi.org/10.1016/0021-8693(83)90119-9openalex-snapshot
On binary equality sets and a solution to the test set conjecture in the binary case
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(84)90004-5openalex-snapshot
The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoids
inferredcites →https://doi.org/10.1016/0304-3975(85)90066-0openalex-snapshot
A proof of Ehrenfeucht's Conjecture
inferredcites →https://doi.org/10.1016/0304-3975(93)90325-nopenalex-snapshot
Efficient constructions of test sets for regular and context-free languages
inferredcites →https://doi.org/10.1016/s0019-9958(80)90659-2openalex-snapshot
Test sets for homomorphism equivalence on context free languages
inferredcites →https://doi.org/10.1016/s0019-9958(82)80028-4openalex-snapshot
Test sets for context free languages and algebraic systems of equations over a free monoid
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-45007-6_6openalex-snapshot
Test Sets for Large Families of Languages
inferred← citeshttps://doi.org/10.1007/3-540-55719-9openalex-snapshot
Automata, Languages and Programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-0751-4_4openalex-snapshot
Solving Problems with Finite Test Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_28openalex-snapshot
Equivalence of Deterministic Nested Word to Word Transducers
inferred← citeshttps://doi.org/10.1007/bfb0049431openalex-snapshot
Testing equivalence of morphisms on context-free languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00064-3openalex-snapshot
On the size of independent systems of equations in semigroups
inferred← citeshttps://doi.org/10.1051/ita/1997310302911openalex-snapshot
Polynomial size test sets for commutative languages
inferred← citeshttps://doi.org/10.1142/s0129054115400134openalex-snapshot
A Survey on Decidable Equivalence Problems for Tree Transducers
inferred← citeshttps://doi.org/10.4204/eptcs.151.5openalex-snapshot
Equivalence Problems for Tree Transducers: A Brief Survey
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.