The isomorphism problem on classes of automatic structures with transitive relations (Q2847190): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Dietrich Kuske / rank
Normal rank
 
Property / author
 
Property / author: Dietrich Kuske / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGEBRAIC LINEAR ORDERINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite presentations of infinite structures: Automata and interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective categoricity of equivalence structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification from a Computable Viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable trees of Scott rank <i>ω</i><sub>1</sub><sup><i>CK</i></sup>, and computable approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaticity of ordinals and of homogeneous graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems of Finite Automata Design and Related Arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An undecidable property of context-free linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of recursive mathematics. Vol. 1: Recursive model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On direct products of automaton decidable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Automatic Well-Founded Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Theoretic Complexity of Automatic Structures (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Structures: Richness and Limitations / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where Automatic Structures Benefit from Weighted Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphisms of scattered automatic linear orders. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Isomorphism Problem for ω-Automatic Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some natural decision problems in automatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic structures of bounded degree revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of Regular Trees and Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysing Complexity in Classes of Unary Automatic Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata Presenting Structures: A Survey of the Finite String Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On frontiers of regular trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The additive group of the rationals does not have an automatic presentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the valuedness of finite transducers / rank
 
Normal rank

Latest revision as of 20:49, 6 July 2024

scientific article
Language Label Description Also known as
English
The isomorphism problem on classes of automatic structures with transitive relations
scientific article

    Statements

    The isomorphism problem on classes of automatic structures with transitive relations (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    recursion-theoretic complexity
    0 references
    automatic structures
    0 references
    isomorphism problem
    0 references
    completeness in the arithmetical hierarchy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references