Polishness of some topologies related to word or tree automata
From MaRDI portal
Publication:5376660
zbMath1454.03061arXiv1710.04002MaRDI QIDQ5376660
Olivier Carton, Dominique Lecomte, Olivier Finkel
Publication date: 17 May 2019
Full work available at URL: https://arxiv.org/abs/1710.04002
infinite wordsCantor spaceBüchi automatonPolish topologyMuller tree automatonBüchi tree automatonregular \(\omega\)-languageautomatic topologyBüchi topologyfiner topologiesspace of infinite labelled binary trees
Formal languages and automata (68Q45) Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Descriptive set theoretic methods in automata theory. Decidability and topological complexity
- Games with winning conditions of high Borel complexity
- Decision problems for Turing machines
- Wadge reducibility and infinite computations
- Descriptive set theory
- \(\omega\)-computations on Turing machines
- Borel chromatic numbers
- A gap property of deterministic tree languages.
- On the power of reading the whole infinite input tape
- Topology and ambiguity in \(\omega\)-context free languages
- Classical and effective descriptive complexities of \(\omega \)-powers
- Shift-invariant topologies for the Cantor space \(X^{\omega}\)
- Ambiguity of {\omega}-Languages of Turing Machines
- Subword Metrics for Infinite Words
- Topologies Refining the Cantor Topology on X ω
- The Complexity of Infinite Computations In Models of Set Theory
- Borel ranks and Wadge degrees of context free $\omega$-languages
- On ω-regular sets
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- Wadge Degrees ofω-Languages of Deterministic Turing Machines
- Monadic Second Order Logic with Measure and Category Quantifiers
- The graph-theoretic approach to descriptive set theory
- A Characterisation of Pi^0_2 Regular Tree Languages
- A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension
- Polishness of some topologies related to word or tree automata
- Decision problems forω-automata
- The Wadge Hierarchy of Deterministic Tree Languages
This page was built for publication: Polishness of some topologies related to word or tree automata
