Skip to content
<title>Channels - Regular tree languages in low levels of the Wadge Hierarchy :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Regular tree languages in low levels of the Wadge Hierarchy
Search for more channels:
Similar Items: Regular tree languages in low levels of the Wadge Hierarchy
Channel Options
View Record
Explore related channels
Quick Look
The Wadge Hierarchy of Deterministic Tree Languages
Quick Look
Ambiguity Hierarchy of Regular Infinite Tree Languages
Quick Look
A survey on difference hierarchies of regular languages
Quick Look
Regular Tree Algebras
Quick Look
On logical hierarchies within FO^2-definable languages
Quick Look
Regular matching problems for infinite trees
Quick Look
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
Quick Look
Statman's Hierarchy Theorem
Quick Look
A Hierarchy of Nondeterminism
Quick Look
Comparing hierarchies of total functionals
Quick Look
The recursion hierarchy for PCF is strict
Quick Look
Piecewise testable tree languages
Quick Look
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
Quick Look
Logic Meets Algebra: the Case of Regular Languages
Quick Look
Separating Regular Languages with First-Order Logic
Quick Look
Families of DFAs as Acceptors of $omega$-Regular Languages
Quick Look
Separating regular languages with two quantifier alternations
Quick Look
On the Monadic Second-Order Transduction Hierarchy
Quick Look
Separation Property for wB- and wS-regular Languages
Quick Look
Learning Regular Languages over Large Ordered Alphabets
Quick Look
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
Quick Look
A rich hierarchy of functionals of finite types
Quick Look
On the Mints Hierarchy in First-Order Intuitionistic Logic
Quick Look
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
Load more items
View Record
Prev
Explore related channels
Next
