Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones

  title={Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones},
  author={Szczepan Hummel},
  • S. Hummel
  • Published in GandALF 7 October 2012
  • Computer Science
The paper gives an example of a tree language G that is recognised by an unambiguous parity automaton and is analytic-complete as a set in Cantor space. This already shows that the unambiguous languages are topologically more complex than the deterministic ones, that are all coanalytic. Using set G as a building block we construct an unambiguous language that is topologically harder than any countable boolean combination of analytic and coanalytic sets. In particular the language is harder… 

Figures from this paper

Unambiguous languages exhaust the index hierarchy

The question whether unambiguous languages are of bounded complexity among all regular tree languages is answered, as exhibited by a family of examples of unambiguity languages that cannot be recognised by any alternating parity tree automata of bounded range of priorities.

Unambiguity and uniformization problems on infinite trees

This work proposes a procedure P designed to decide if a given tree automaton recognizes a bi-unambiguous language, and conjecture that P is complete for all inputs but this depends on a new conjecture stating that there is no MSO-definable choice function on thin trees.

On Unambiguous Regular Tree Languages of Index (0, 2)

This work provides operations that generate a family (A_{alpha})_{alpha < phi_2(0)} of unambiguous automata such that it respects the strict Wadge ordering.

Topological Complexity of Sets Defined by Automata and Formulas

By considering in nite structures a variety of complexity measures that come from descriptive set theory, the theory of de nability and the grammatical complexity of their definitions is measured.

Introduction to Automaton Theory

A game used to simulate the possible runs of a tree automaton will be introduced, which can prove Rabin's complementation theorem and the relations between logics and tree automata will be showed.

Measure properties of regular sets of trees

An upper bound on the complexity of recognizable tree languages

An embedding of the Wadge hierarchy of non self-dual Borel subsets of the Cantor space into the class of regular tree languages is argued to be much better than the usual ${\bf\Delta}^1\_2$.

Unambiguous Büchi Is Weak

The main theorem of this paper is a correctness proof of the transformation algorithm, which is based on a separation algorithm of Arnold and Santocanale 2005 and extends results of Finkel and Simonnet 2009.

Descriptive Set Theoretic Methods in Automata Theory

Wyniki przedstawione w rozprawie są oparte o [HS12, FMS13, BIS13, BS13, Skr14, BGMS14] oraz raport techniczny [MS14], która odnosi się jedynie do automatów.



Forms of Determinism for Automata

Some variants of the notion of determinism are surveyed, refining the spectrum between non-determinism and determinism, and various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost functions are instantiated.

On the Topological Complexity of MSO+U and Related Automata Models

This work shows that for each i ∈ ω there exists a $\Sigma ^1_i$-hard ω-word language definable in Monadic Second Order Logic extended with the unbounding quantifier (MSO+U), and solves the topological complexity of MSO+ U.

Choice functions and well-orderings over the infinite binary tree

A new proof is given showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree and how the result can be used to prove the inherent ambiguity of languages of infinite trees.

MSO on the Infinite Binary Tree: Choice and Order

It is shown that every infinite binary tree with a well-founded order has an undecidable MSO-theory, and some applications of the result concerning unambiguous tree automata and definability of winning strategies in infinite games are discussed.

On Recognizable Tree Languages Beyond the Borel Hierarchy

The topological complexity of non Borel recognizable tree languages with regard to the difference hierarchy of analytic sets is investigated and it is proved that the D$_{ω^n}$(Σ$^1_1$)-complete tree languages L$_n$ are Wadge reducible to the game tree language W$(i,κ)}$ for κ−ig 2.

Forms of Determinism for Automata (Invited Talk)

Some variants of the notion of determinism are surveyed, refining the spectrum between non-determinism and determinism, and unambiguous automata are presented, strongly unambiguous Automata, prophetic automata, guidableAutomata, and history-deterministic automata.

Bounds in ω-regularity

We consider an extension of ω-regular expressions where two new variants of the Kleene star L are added: L and L. These exponents act as the standard star, but restrict the number of iterations to be

Weak MSO with the Unbounding Quantifier

A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of ω- regular languages, and effective translations between the logic and automata are given.

Bounds in w-Regularity

We consider an extension of omega-regular expressions where two new variants of the Kleene star L* are added: LB and LS . These exponents act as the standard star, but restrict the number of