Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

CSL
2005
Springer

favoriteEmaildiscussreport

84views Automated Reasoning» more CSL 2005»

On Deciding Topological Classes of Deterministic Tree Languages

14 years 1 months ago

On Deciding Topological Classes of Deterministic Tree Languages

Download www.mimuw.edu.pl

Abstract. It has been proved by Niwi´nski and Walukiewicz that a deterministic tree language is either Π1 1 -complete or it is on the level Π0 3 of the Borel hierarchy, and that it can be decided eﬀectively which of the two takes place. In this paper we show how to decide if the language recognized by a given deterministic tree automaton is on the Π0 2 , the Σ0 2 , or the Σ0 3 level. Together with the previous results it gives a procedure calculating the exact position of a deterministic tree language in the topological hierarchy.

Filip Murlak

Real-time Traffic

CSL 2005 | Deterministic Tree | Deterministic Tree Automaton | Deterministic Tree Language |

claim paper

Related Content

» A Contraction Method to Decide MSO Theories of Deterministic Trees

» Decidability of MSO Theories of Tree Structures

» The Wadge Hierarchy of Deterministic Tree Languages

» From Determinism to Nondeterminism in Recognizable TwoDimensional Languages

» Deterministic Automata on Unranked Trees

» Linear Game Automata Decidable Hierarchy Problems for StrippedDown Alternating Tree Automa...

» Linear ContextFree Rewriting Systems and Deterministic TreeWalking Transducers

» Deciding the finiteness of the number of simple permutations contained in a wreathclosed c...

» TreeWalking Automata Cannot Be Determinized

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CSL
Authors	Filip Murlak

Comments (0)