On the public citation graph
A characterization of systolic binary tree automata and applications
0 signed · 18 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/bf00289573openalex-snapshot
Systolic automata for VLSI on balanced trees
inferredcites →https://doi.org/10.1016/0304-3975(83)90032-4openalex-snapshot
On a family of L languages resulting from systolic tree automata
inferredcites →https://doi.org/10.1016/0304-3975(83)90146-9openalex-snapshot
Systolic trees and systolic language recognition by tree automata
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-50647-0_112openalex-snapshot
Basic research for cellular processing
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_16openalex-snapshot
On the complexity of some reachability problems
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_101openalex-snapshot
State complexity of SBTA languages
inferred← citeshttps://doi.org/10.1007/bf01191895openalex-snapshot
Languages accepted by systolic Y-tree automata: structural characterizations
inferred← citeshttps://doi.org/10.1007/bf01303058openalex-snapshot
Power of interconnections and of nondeterminism in regularY-tree systolic automata
inferred← citeshttps://doi.org/10.1007/bfb0029616openalex-snapshot
Comparisons among classes of Y-tree systolic automata
inferred← citeshttps://doi.org/10.1007/bfb0030288openalex-snapshot
Systolic automata — power, characterizations, nonhomogeneity
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00170-4openalex-snapshot
Completeness results concerning systolic tree automata and E0L languages
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90091-xopenalex-snapshot
Topological transformations as a tool in the design of systolic networks
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90076-xopenalex-snapshot
C-tree systolic automata
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90190-sopenalex-snapshot
Synthesis, structure and power of systolic computations
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90277-9openalex-snapshot
Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
inferred← citeshttps://doi.org/10.1016/0734-189x(85)90096-9openalex-snapshot
Picture processing: 1984
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80090-xopenalex-snapshot
A kleene-like characterization of languages accepted by systolic tree automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00133-8openalex-snapshot
Succinctness of descriptions of SBTA-languages
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.