On the public citation graph

Why These Automata Types?

https://doi.org/10.29007/c3bj
0 signed · 50 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.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1007/11549345_43openalex-snapshot
Complexity Bounds for Regular Games
inferredcites →https://doi.org/10.1007/11874683_26openalex-snapshot
Solving Games Without Determinization
inferredcites →https://doi.org/10.1007/3-540-07389-2_231openalex-snapshot
A hierarchy of regular sequence sets
inferredcites →https://doi.org/10.1007/3-540-16761-7_77openalex-snapshot
Alternating automata, the weak monadic theory of the tree, and its complexity
inferredcites →https://doi.org/10.1007/3-540-44929-9_36openalex-snapshot
Alternating Automata and Logics over Infinite Words
inferredcites →https://doi.org/10.1007/3-540-45315-6_18openalex-snapshot
On the Complexity of Parity Word Automata
inferredcites →https://doi.org/10.1007/3-540-45744-5_50openalex-snapshot
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
inferredcites →https://doi.org/10.1007/3-540-52590-4_43openalex-snapshot
A unified approach for showing language containment and equivalence between various types of ω-automata
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_13openalex-snapshot
From LTL to Deterministic Automata: A Safraless Compositional Approach
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_31openalex-snapshot
The Hanoi Omega-Automata Format
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_14openalex-snapshot
Complementation Constructions for Nondeterministic Automata on Infinite Words
inferredcites →https://doi.org/10.1007/978-3-540-71389-0_12openalex-snapshot
Generalized Parity Games
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_7openalex-snapshot
Deterministic Automata for the (F,G)-Fragment of LTL
inferredcites →https://doi.org/10.1007/978-3-642-39212-2_11openalex-snapshot
Nondeterminism in the Presence of a Diverse or Unknown Future
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_37openalex-snapshot
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
inferredcites →https://doi.org/10.1016/0167-6423(87)90036-0openalex-snapshot
Modalities for model checking: branching time logic strikes back
inferredcites →https://doi.org/10.1016/0168-0072(94)90086-8openalex-snapshot
Progress measures, immediate determinacy, and a subset construction for tree automata
inferredcites →https://doi.org/10.1016/0304-3975(94)00214-4openalex-snapshot
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
inferredcites →https://doi.org/10.1109/lics.2009.13openalex-snapshot
An Improved Lower Bound for the Complementation of Rabin Automata
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1145/3209108.3209164openalex-snapshot
Rational Synthesis Under Imperfect Information
inferredcites →https://doi.org/10.1145/41625.41626openalex-snapshot
Specification and verification of concurrent programs by A ∀ automata
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes
inferredcites →https://doi.org/10.4204/eptcs.256.13openalex-snapshot
LTL to Deterministic Emerson-Lei Automata
inferredcites →https://doi.org/10.4230/lipics.csl.2011.112openalex-snapshot
Tight Upper Bounds for Streett and Parity Complementation
inferredcites →https://doi.org/10.4230/lipics.csl.2017.12openalex-snapshot
On the (In)Succinctness of Muller Automata
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2011.339openalex-snapshot
A Tight Lower Bound for Streett Complementation
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2017.17openalex-snapshot
Rabin vs. Streett Automata
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2017.18openalex-snapshot
How Deterministic are Good-For-Games Automata?
inferredcites →https://doi.org/10.7146/dpb.v21i430.7953openalex-snapshot
Progress measures, immediate determinacy, and a subset construction for 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/978-3-030-24886-4_1openalex-snapshot
Inherent Size Blowup in $$\omega $$ -Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-89716-1_1openalex-snapshot
Quantitative vs. Weighted Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-99253-8_7openalex-snapshot
Token Games and History-Deterministic Quantitative Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-99253-8_8openalex-snapshot
On the Translation of Automata to Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-33264-7_12openalex-snapshot
Zielonka DAG Acceptance and Regular Languages over Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_13openalex-snapshot
Synthesis with Privacy Against an Observer
inferred← citeshttps://doi.org/10.1007/s11334-022-00445-7openalex-snapshot
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
inferred← citeshttps://doi.org/10.1145/3584676.3584682openalex-snapshot
When a Little Nondeterminism Goes a Long Way
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d95openalex-snapshot
Polynomial Identification of $\omega$-Automata
inferred← citeshttps://doi.org/10.4204/eptcs.428.9openalex-snapshot
How Concise are Chains of co-Büchi Automata?
inferred← citeshttps://doi.org/10.4230/lipics.concur.2019.19openalex-snapshot
Good for Games Automata: From Nondeterminism to Alternation
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:8)2023openalex-snapshot
Token Games and History-Deterministic Quantitative-Automata
inferred← citeshttps://doi.org/10.46298/lmcs-20(4:10)2024openalex-snapshot
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
inferred← citeshttps://doi.org/10.46298/theoretics.24.12openalex-snapshot
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
inferred← citeshttps://doi.org/10.48550/arxiv.2002.03191openalex-snapshot
Polynomial time algorithms for inclusion and equivalence of deterministic omega acceptors
inferred← citeshttps://doi.org/10.60882/cispa.24613122.v1openalex-snapshot
Approximate Automata for Omega-Regular Languages
inferred← citeshttps://doi.org/10.70675/660020c0z10a3z4b40zac0ez5871de2a15ecopenalex-snapshot
Structural properties of automata over infinite words and memory for games
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.