Pages that link to "Item:Q1951601"
From MaRDI portal
The following pages link to Isomorphism of regular trees and words (Q1951601):
Displayed 9 items.
- Tree compression using string grammars (Q1742370) (← links)
- Pro-aperiodic monoids via saturated models (Q2279939) (← links)
- The ordinal generated by an ordinal grammar is computable (Q2326394) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- The Order Type of Scattered Context-Free Orderings of Rank One Is Computable (Q3297776) (← links)
- Compressed Tree Canonization (Q3449487) (← links)
- Grammar-Based Tree Compression (Q3451087) (← links)