An upper bound on the complexity of recognizable tree languages (Q5501862): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963989869 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.02840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling with Uncertain Communication Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the Borel Complexity of Regular Tree Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Determinacy of Context-Free Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Recognizable Tree Languages Beyond the Borel Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure Properties of Game Tree Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Import of Zermelo's Well-Ordering Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Wadge Hierarchy of Deterministic Tree Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A gap property of deterministic tree languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borel hierarchy is infinite in the class of regular sets of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-bounded trees and analytic inductions / rank
 
Normal rank

Latest revision as of 15:10, 10 July 2024

scientific article; zbMATH DE number 6472658
Language Label Description Also known as
English
An upper bound on the complexity of recognizable tree languages
scientific article; zbMATH DE number 6472658

    Statements

    An upper bound on the complexity of recognizable tree languages (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2015
    0 references
    infinite trees
    0 references
    tree automaton
    0 references
    regular tree language
    0 references
    Cantor topology
    0 references
    topological complexity
    0 references
    Borel hierarchy
    0 references
    game quantifier
    0 references
    wadge classes
    0 references
    wadge degrees
    0 references
    universal sets
    0 references
    provably-\(\Delta^{1}_{2}\)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references