On the public citation graph
An automata-theoretic characterization of the OI-hierarchy
0 signed · 28 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-07142-3_84openalex-snapshot
An algebraic formulation of the Chomsky hierarchy
inferredcites →https://doi.org/10.1007/3-540-09526-8_23openalex-snapshot
An algebraic extension of the Chomsky — hierarchy
inferredcites →https://doi.org/10.1007/3-540-10828-9_58openalex-snapshot
Top-down tree-transducers for infinite trees I
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(82)90009-3openalex-snapshot
The IO- and OI-hierarchies
inferredcites →https://doi.org/10.1016/s0019-9958(70)80039-0openalex-snapshot
Full AFLs and nested iterated substitution
inferredcites →https://doi.org/10.1016/s0019-9958(80)90867-0openalex-snapshot
On deterministic indexed languages
inferredcites →https://doi.org/10.1051/ita/1977110302371openalex-snapshot
Sémantique algébrique d'un langage de programmation type Algol
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
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-58179-0_52openalex-snapshot
Model checking of macro processes
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_8openalex-snapshot
The ETOL Hierarchy is in the oi Hierarchy
inferred← citeshttps://doi.org/10.1007/bf01704910openalex-snapshot
Iterated linear control and iterated one-turn pushdowns
inferred← citeshttps://doi.org/10.1007/bfb0015742openalex-snapshot
Characterization of high level tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0016288openalex-snapshot
The OI-hierarchy is closed under control
inferred← citeshttps://doi.org/10.1007/bfb0017155openalex-snapshot
On the expressive strength of the finitely typed lambda — terms
inferred← citeshttps://doi.org/10.1007/bfb0028831openalex-snapshot
Iterated linear control and iterated one-turn pushdowns
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90068-1openalex-snapshot
Infinitary tree languages recognized by ω-automata
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90009-3openalex-snapshot
The IO- and OI-hierarchies
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90052-6openalex-snapshot
Pushdown machines for the macro tree transducer
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90210-7openalex-snapshot
On the expressive power of finitely typed and universally polymorphic recursive procedures
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104657openalex-snapshot
Principal abstract families of weighted tree languages
inferred← citeshttps://doi.org/10.1145/800061.808767openalex-snapshot
Iterated pushdown automata and complexity classes
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.