On the public citation graph

Automatic structures: richness and limitations

0 signed · 47 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/3-540-60178-3_93openalex-snapshot
Automatic presentations of structures
inferredcites →https://doi.org/10.1016/0021-8693(69)90107-0openalex-snapshot
Sets recognized by n-tape automata
inferredcites →https://doi.org/10.1016/j.crma.2004.03.035openalex-snapshot
Automaticité des ordinaux et des graphes homogènes
inferredcites →https://doi.org/10.1017/cbo9780511551574openalex-snapshot
Model Theory
inferredcites →https://doi.org/10.1023/a:1021758312697openalex-snapshot
Computable Structure and Non-Structure Theorems
inferredcites →https://doi.org/10.1109/lics.2000.855755openalex-snapshot
Automatic structures
inferredcites →https://doi.org/10.1109/lics.2001.932518openalex-snapshot
A model-theoretic approach to regular string relations
inferredcites →https://doi.org/10.1109/lics.2002.1029829openalex-snapshot
Tree extension algebras: logics, automata, and query languages
inferredcites →https://doi.org/10.1109/lics.2002.1029832openalex-snapshot
Some results on automatic structures
inferredcites →https://doi.org/10.1109/lics.2003.1210057openalex-snapshot
Logical definability and query languages over unranked trees
inferredcites →https://doi.org/10.1145/1094622.1094625openalex-snapshot
Automatic linear orders and trees
inferredcites →https://doi.org/10.1147/rd.176.0525openalex-snapshot
Logical Reversibility of Computation
inferredcites →https://doi.org/10.1201/9781439865699openalex-snapshot
Word Processing in Groups

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11672142_23openalex-snapshot
Invariants of Automatic Presentations and Semi-synchronous Transductions
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_3openalex-snapshot
Finite Model Theory and Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_30openalex-snapshot
Hamiltonicity of automatic graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_24openalex-snapshot
Injection Structures Specified by Finite State Transducers
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_57openalex-snapshot
Automatic Presentations for Finitely Generated Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_9openalex-snapshot
Sequential Automatic Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_29openalex-snapshot
Finite Automata Presentable Abelian Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_47openalex-snapshot
Unary Automatic Graphs: An Algorithmic Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_15openalex-snapshot
Automatic Presentations for Cancellative Semigroups
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_27openalex-snapshot
Path Feasibility Analysis for String-Manipulating Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_44openalex-snapshot
Analysing Complexity in Classes of Unary Automatic Structures
inferred← citeshttps://doi.org/10.1007/s00224-020-09974-9openalex-snapshot
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures
inferred← citeshttps://doi.org/10.1007/s00236-008-0083-2openalex-snapshot
Semi-synchronous transductions
inferred← citeshttps://doi.org/10.1007/s11202-005-0005-2openalex-snapshot
Complexity of some natural problems in automatic structures
inferred← citeshttps://doi.org/10.1007/s11390-017-1787-yopenalex-snapshot
Automated String Constraints Solving for Programs Containing String Manipulation Functions
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.012openalex-snapshot
Model-theoretic complexity of automatic structures
inferred← citeshttps://doi.org/10.1016/j.apal.2013.03.001openalex-snapshot
Automatic models of first order theories
inferred← citeshttps://doi.org/10.1016/j.ic.2009.02.005openalex-snapshot
Automatic presentations for semigroups
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2007.04.015openalex-snapshot
FA-presentable groups and rings
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.045openalex-snapshot
Deciding the isomorphism problem in classes of unary automatic structures
inferred← citeshttps://doi.org/10.1017/cbo9780511778421.008openalex-snapshot
Three lectures on automatic structures
inferred← citeshttps://doi.org/10.1017/s0960129508007342openalex-snapshot
Unary automatic graphs: an algorithmic perspective
inferred← citeshttps://doi.org/10.1090/s0002-9947-2013-05766-2openalex-snapshot
The isomorphism problem on classes of automatic structures with transitive relations
inferred← citeshttps://doi.org/10.1109/lics.2008.28openalex-snapshot
From Automatic Structures to Borel Structures
inferred← citeshttps://doi.org/10.1142/s0218196711006625openalex-snapshot
BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS
inferred← citeshttps://doi.org/10.1142/s0218196712500385openalex-snapshot
UNARY FA-PRESENTABLE SEMIGROUPS
inferred← citeshttps://doi.org/10.1145/1094622.1094625openalex-snapshot
Automatic linear orders and trees
inferred← citeshttps://doi.org/10.1145/3373718.3394734openalex-snapshot
Automatic Structures
inferred← citeshttps://doi.org/10.2168/lmcs-3(2:4)2007openalex-snapshot
Transforming structures by set interpretations
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.122openalex-snapshot
Comparing the power of advice strings: a notion of complexity for infinite words
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1360openalex-snapshot
Cardinality and counting quantifiers on omega-automatic structures
inferred← citeshttps://doi.org/10.48550/arxiv.0809.3330openalex-snapshot
Unary Automatic Graphs: An Algorithmic Perspective
inferred← citeshttps://doi.org/10.48550/arxiv.1303.0214openalex-snapshot
Unary FA-presentable binary relations: transitivity and classification results
inferred← citeshttps://doi.org/10.48550/arxiv.1802.06529openalex-snapshot
Automatic supermartingales acting on sequences
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.