On the public citation graph

Systolic automata for VLSI on balanced trees

https://doi.org/10.1007/bf00289573
0 signed · 37 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.1016/0304-3975(83)90032-4openalex-snapshot
On a family of L languages resulting from systolic 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-54458-5_65openalex-snapshot
Systolic Y-tree automata: closure properties and decision problems
inferred← citeshttps://doi.org/10.1007/3-540-57369-0_26openalex-snapshot
On learning systolic languages
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-58078-6_20openalex-snapshot
The complexity of systolic dissemination of information in interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_101openalex-snapshot
State complexity of SBTA languages
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_59openalex-snapshot
Effective systolic algorithms for gossiping in cycles and two-dimensional grids
inferred← citeshttps://doi.org/10.1007/3540185356_27openalex-snapshot
Lower bound techniques for VLSI algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_2openalex-snapshot
Systolic Automata and P Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_34openalex-snapshot
A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_5openalex-snapshot
Computations on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-94-015-9153-9_3openalex-snapshot
Computations on Cellular Automata
inferred← citeshttps://doi.org/10.1007/bf00289240openalex-snapshot
A characterization of systolic binary tree automata and applications
inferred← citeshttps://doi.org/10.1007/bf00990900openalex-snapshot
Syntactic monoids in the construction of systolic tree automata
inferred← citeshttps://doi.org/10.1007/bf01185564openalex-snapshot
Classes of systolic Y-tree automata and a comparison with systolic trellis automata
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(83)90032-4openalex-snapshot
On a family of L languages resulting from systolic tree automata
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90146-9openalex-snapshot
Systolic trees and systolic language recognition by tree automata
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90015-xopenalex-snapshot
Characterizations and computational complexity of systolic trellis automata
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90043-4openalex-snapshot
Iterative tree automata
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/s0019-9958(86)80011-0openalex-snapshot
Systolic trellis automata: Stability, decidability and complexity
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
inferred← citeshttps://doi.org/10.1051/ita/1994283-403031openalex-snapshot
The complexity of systolic dissemination of information in interconnection networks
inferred← citeshttps://doi.org/10.1051/ita/1994283-404251openalex-snapshot
Publications of K. Culik
inferred← citeshttps://doi.org/10.1080/00207168308803390openalex-snapshot
Programmable finite automata for VLSI†
inferred← citeshttps://doi.org/10.1080/00207168408803410openalex-snapshot
Systolic trellis automatata †
inferred← citeshttps://doi.org/10.1080/00207168408803421openalex-snapshot
Systolic trellis automatat†
inferred← citeshttps://doi.org/10.3233/fi-1997-29402openalex-snapshot
CHOMSKY HIERARCHY AND SYSTOLIC Y-TREE AUTOMATA
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.