Skip to content
<title>Channels - Tree-Automatic Well-Founded Trees :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Tree-Automatic Well-Founded Trees
Search for more channels:
Similar Items: Tree-Automatic Well-Founded Trees
Channel Options
View Record
Explore related channels
Quick Look
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
Quick Look
Regular Tree Algebras
Quick Look
Logics for Unranked Trees: An Overview
Quick Look
Piecewise testable tree languages
Quick Look
Global Numerical Constraints on Trees
Quick Look
Containment for Conditional Tree Patterns
Quick Look
Minimisation of Multiplicity Tree Automata
Quick Look
Pushing for weighted tree automata
Quick Look
Trees from Functions as Processes
Quick Look
Optimizing tree decompositions in MSO
Quick Look
The Expansion Problem for Infinite Trees
Quick Look
Visibly Tree Automata with Memory and Constraints
Quick Look
The Wadge Hierarchy of Deterministic Tree Languages
Quick Look
Computation Tree Logic with Deadlock Detection
Quick Look
Tree-width for first order formulae
Quick Look
On Ramsey properties of classes with forbidden trees
Quick Look
Algebraic and logical descriptions of generalized trees
Quick Look
Axiomatization of betweenness in order-theoretic trees
Quick Look
Regular matching problems for infinite trees
Quick Look
The Power-Set Construction for Tree Algebras
Quick Look
Learning on hierarchical trees with Random Forest
Quick Look
Alternating register automata on finite words and trees
Quick Look
Analyzing Timed Systems Using Tree Automata
Quick Look
Ambiguity Hierarchy of Regular Infinite Tree Languages
Load more items
View Record
Prev
Explore related channels
Next
