On the public citation graph
Invariants of Automatic Presentations and Semi-synchronous Transductions
0 signed · 29 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-60178-3_93openalex-snapshot
Automatic presentations of structures
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_39openalex-snapshot
Definability and Regularity in Automatic Structures
inferredcites →https://doi.org/10.1007/978-3-540-39813-4_24openalex-snapshot
Is Cantor’s Theorem Automatic?
inferredcites →https://doi.org/10.1007/978-3-662-07003-1openalex-snapshot
Elements of Finite Model Theory
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/s00224-004-1133-yopenalex-snapshot
Finite Presentations of Infinite Structures: Automata and Interpretations
inferredcites →https://doi.org/10.1016/0168-0072(89)90070-5openalex-snapshot
Definability hierarchies of generalized quantifiers
inferredcites →https://doi.org/10.1016/0304-3975(82)90042-1openalex-snapshot
On direct products of automaton decidable theories
inferredcites →https://doi.org/10.1016/0304-3975(93)90230-qopenalex-snapshot
Synchronized rational relations of finite and infinite words
inferredcites →https://doi.org/10.1109/lics.2004.11openalex-snapshot
Automatic structures: richness and limitations
inferredcites →https://doi.org/10.1147/rd.91.0047openalex-snapshot
On Relations Defined by Generalized Finite Automata
inferredcites →https://doi.org/10.2307/2275643openalex-snapshot
Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
inferredcites →https://doi.org/10.2307/2695073openalex-snapshot
Epsilon-logic is more expressive than first-order logic over finite structures
inferredcites →https://doi.org/10.25596/jalc-2003-287openalex-snapshot
Automatic Structures: Overview and Future Directions
inferredcites →https://doi.org/10.36045/bbms/1103408547openalex-snapshot
Logic and {$p$}-recognizable sets of integers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11874683_27openalex-snapshot
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
inferred← citeshttps://doi.org/10.1007/978-3-642-03564-7_5openalex-snapshot
Theories of Automatic Structures and Their Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_27openalex-snapshot
Automatic Structures of Bounded Degree Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-24897-9_12openalex-snapshot
Where Automatic Structures Benefit from Weighted Automata
inferred← citeshttps://doi.org/10.1007/s00236-008-0083-2openalex-snapshot
Semi-synchronous transductions
inferred← citeshttps://doi.org/10.1017/cbo9780511974960.002openalex-snapshot
Automata-based presentations of infinite structures
inferred← citeshttps://doi.org/10.1051/ita:2008008openalex-snapshot
A Hierarchy of Automaticω-Words having a Decidable MSO Theory
inferred← citeshttps://doi.org/10.2168/lmcs-3(2:4)2007openalex-snapshot
Transforming structures by set interpretations
inferred← citeshttps://doi.org/10.2178/bsl/1208442827openalex-snapshot
Automata Presenting Structures: A Survey of the Finite String Case
inferred← citeshttps://doi.org/10.48550/arxiv.0810.4998openalex-snapshot
Automatic structures of bounded degree revisited
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.