On the public citation graph

A hierarchy of sets of infinite trees

0 signed · 27 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.1007/bf01691346openalex-snapshot

Generalized finite automata theory with an application to a decision problem of second-order logic

inferredcites →https://doi.org/10.1016/s0019-9958(66)80013-xopenalex-snapshot

Testing and generating infinite sequences by a finite automaton

inferredcites →https://doi.org/10.1016/s0019-9958(81)90663-xopenalex-snapshot

A combinatorial approach to the theory of ω-automata

inferredcites →https://doi.org/10.1016/s0022-0000(70)80041-1openalex-snapshot

Tree acceptors and some of their applications

inferredcites →https://doi.org/10.1016/s0049-237x(08)71929-3openalex-snapshot

Weakly Definable Relations and Special Automata

inferredcites →https://doi.org/10.1090/cbms/013openalex-snapshot

Automata on Infinite Objects and Church’s Problem

inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot

Decidability of second-order theories and automata on infinite trees.

inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot

Theory of Recursive Functions and Effective Computability

inferredcites →https://doi.org/10.1145/800070.802176openalex-snapshot

Ensembles reconnaissables de mots biinfinis

inferredcites →https://doi.org/10.2307/2316720openalex-snapshot

Theory of Recursive Functions and Effective Computability.

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-18625-5_41openalex-snapshot

Automata, games, and positive monadic theories of trees

inferred← citeshttps://doi.org/10.1007/3-540-44450-5_15openalex-snapshot

The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite

inferred← citeshttps://doi.org/10.1007/3-540-51486-4_91openalex-snapshot

Pushdown automata on infinite trees and omega-Kleene closure of context-free tree sets

inferred← citeshttps://doi.org/10.1007/3-540-53487-3_37openalex-snapshot

Recognizable infinite tree sets and their complexity

inferred← citeshttps://doi.org/10.1007/3-540-58043-3_29openalex-snapshot

Logical specifications of infinite computations

inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot

Languages, Automata, and Logic

inferred← citeshttps://doi.org/10.1007/bfb0030294openalex-snapshot

Recent results on automata and infinite words

inferred← citeshttps://doi.org/10.1016/0304-3975(86)90183-0openalex-snapshot

Variétés d'automates descendants d'arbres infinis

inferred← citeshttps://doi.org/10.1016/0304-3975(87)90085-5openalex-snapshot

Topological characterizations of infinite tree languages

inferred← citeshttps://doi.org/10.1016/0304-3975(91)90158-xopenalex-snapshot

Generalized automata on infinite trees and Muller-McNaughton's Theorem

inferred← citeshttps://doi.org/10.1016/0304-3975(91)90283-8openalex-snapshot

Hierarchies of weak automata and weak monadic formulas

inferred← citeshttps://doi.org/10.1016/0890-5401(89)90046-1openalex-snapshot

Automata on infinite objects and their applications to logic and programming

inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot

Automata on Infinite Objects

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00452-8openalex-snapshot

A gap property of deterministic tree languages

inferred← citeshttps://doi.org/10.1051/ita:1999121openalex-snapshot

Theμ-calculus alternation-depth hierarchy is strict on binary trees

inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1318openalex-snapshot

Weak index versus Borel rank

inferred← citeshttps://doi.org/10.70675/ab8c4538zf338z4b1dzb5c4z539a6179abc8openalex-snapshot

A study on the expressive power of some fragments of the modal µ-calculus

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.