scientific article; zbMATH DE number 17558

DOI10.1007/3-540-51498-8_40MaRDI QIDQ3974883zbMATH OpenFDO

Authors Jerzy Skurczyński

Publication date 26 June 1992

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51498-8_40

zbMATH Keywords

Borel hierarchyregular sets of infinite treestree languages

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Review text

[For the entire collection see Zbl 0726.00019.] The Borel hierarchy is shown to be infinite in the following two classes: in the class of regular sets of infinite trees; in the class of tree languages acceptable by automata with weak (i.e. Muller-type) conditions.

Recommendations

• scientific article; zbMATH DE number 3993563
• Deciding the Borel complexity of regular tree languages
• Regular tree languages in low levels of the Wadge hierarchy
• Various hierarchies of \(\omega\)-regular sets
• Measure properties of regular sets of trees

Cited in

(2)

• Borel* sets in the generalized Baire space and infinitary languages
• scientific article; zbMATH DE number 3993563 (Why is no real title available?)

This page was built for publication:

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