Deciding the Borel Complexity of Regular Tree Languages
From MaRDI portal
Publication:5175888
DOI10.1007/978-3-319-08019-2_17zbMath1432.03072arXiv1403.3502OpenAlexW2964037520MaRDI QIDQ5175888
Henryk Michalewski, Alessandro Facchini
Publication date: 25 February 2015
Published in: Language, Life, Limits (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.3502
Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05)
Related Items
Unnamed Item, A Characterisation of Pi^0_2 Regular Tree Languages, An upper bound on the complexity of recognizable tree languages