Pages that link to "Item:Q4337430"
From MaRDI portal
The following pages link to Minimal Ascending and Descending Tree Automata (Q4337430):
Displaying 12 items.
- Regular languages with variables on graphs (Q418127) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Deciding top-down determinism of regular tree languages (Q2140513) (← links)
- Smoothing and compression with stochastic \(k\)-testable tree languages (Q2485083) (← links)
- State Complexity of Regular Tree Languages for Tree Matching (Q2974061) (← links)
- (Q3325054) (← links)
- BISIMULATION MINIMIZATION OF TREE AUTOMATA (Q3503087) (← links)
- A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata (Q3653096) (← links)
- A note on the minimalization of tree-automata (Q4029594) (← links)
- A Congruence-Based Perspective on Finite Tree Automata (Q5025071) (← links)
- Checking in polynomial time whether or not a regular tree language is deterministic top-down (Q6121430) (← links)