We gratefully acknowledge support from
the Simons Foundation
and member institutions
Full-text links:

Download:

Current browse context:

cs.LO

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo Facebook logo LinkedIn logo del.icio.us logo Digg logo Reddit logo ScienceWISE logo

Computer Science > Logic in Computer Science

Title: Deciding the Borel complexity of regular tree languages

Abstract: We show that it is decidable whether a given a regular tree language belongs to the class ${\bf \Delta^0_2}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.
Comments: 15 pages, 2 figures
Subjects: Logic in Computer Science (cs.LO); Formal Languages and Automata Theory (cs.FL); Logic (math.LO)
Cite as: arXiv:1403.3502 [cs.LO]
  (or arXiv:1403.3502v1 [cs.LO] for this version)

Submission history

From: Alessandro Facchini [view email]
[v1] Fri, 14 Mar 2014 08:41:02 GMT (73kb,D)