Tree-Automatic Well-Founded Trees (Q5891703): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3172381 / 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: Classification from a Computable Viewpoint / 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: Q4451633 / 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: Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Model Checking on Generalisations of Pushdown Graphs / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic presentations of structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Structures: Richness and Limitations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic linear orders and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism problem on classes of automatic structures with transitive relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic structures of bounded degree revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrent Reachability Analysis in Regular Model Checking / rank
 
Normal rank

Latest revision as of 14:04, 5 July 2024

scientific article; zbMATH DE number 6065545
Language Label Description Also known as
English
Tree-Automatic Well-Founded Trees
scientific article; zbMATH DE number 6065545

    Statements

    Tree-Automatic Well-Founded Trees (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2012
    0 references

    Identifiers