Unambiguous tree languages are topologically harder than deterministic ones

zbMATH Open1459.68102arXiv1210.2463MaRDI QIDQ4986520FDOQ4986520

Authors: Szczepan Hummel 

Publication date: 27 April 2021

Full work available at URL: https://arxiv.org/abs/1210.2463

Recommendations

• On unambiguous regular tree languages of index \((0,2)\)
• On recognizable tree languages beyond the Borel hierarchy
• Unambiguous languages exhaust the index hierarchy
• On the strength of unambiguous tree automata
• scientific article; zbMATH DE number 6680130

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive set theory (03E15)

Cited In (5)

• It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton
• Measure properties of regular sets of trees
• Unambiguous languages exhaust the index hierarchy
• On unambiguous regular tree languages of index \((0,2)\)
• On the strength of unambiguous tree automata

This page was built for publication: Unambiguous tree languages are topologically harder than deterministic ones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986520)