Regular languages of thin trees
From MaRDI portal
Publication:290908
DOI10.1007/S00224-014-9595-ZzbMATH Open1350.68173DBLPjournals/mst/IdziaszekSB16OpenAlexW2036628157WikidataQ59472496 ScholiaQ59472496MaRDI QIDQ290908FDOQ290908
Tomasz Idziaszek, Michał Skrzypczak, Mikołaj Bojańczyk
Publication date: 3 June 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2013/3965/
Recommendations
- Regular languages of thin trees
- Regular tree languages in low levels of the Wadge hierarchy
- Regular tree languages and quasi orders
- STACS 2005
- scientific article; zbMATH DE number 794243
- On regular tree languages and deterministic pushdown automata
- scientific article
- Nondeterministic tree width of regular languages
- Algebraic recognizability of regular tree languages
- A Characterisation of Pi^0_2 Regular Tree Languages
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- The Borel hierarchy is infinite in the class of regular sets of trees
- A gap property of deterministic tree languages.
- Title not available (Why is that?)
- Interpretations in Trees with Countably Many Branches
- Title not available (Why is that?)
- Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
- Algebra for Infinite Forests with an Application to the Temporal Logic EF
- On Recognizable Tree Languages Beyond the Borel Hierarchy
- Title not available (Why is that?)
- Title not available (Why is that?)
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- Uniformization and skolem functions in the class of trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- On the Borel Inseparability of Game Tree Languages
- Recognisability for algebras of infinite trees
- Title not available (Why is that?)
- The Wadge Hierarchy of Deterministic Tree Languages
Cited In (9)
- Relatively regular languages and thin codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequences with increasing subsequence
- Title not available (Why is that?)
- Algebra for trees
- Title not available (Why is that?)
This page was built for publication: Regular languages of thin trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290908)
