Linking theorems for tree transducers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4108162
- scientific article; zbMATH DE number 1354999
- Equivalence problems for tree transducers: a brief survey
- scientific article; zbMATH DE number 3945364
- scientific article; zbMATH DE number 3858448
- scientific article; zbMATH DE number 6131600
- STACS 2004
- scientific article; zbMATH DE number 4043278
- Equivalence of symbolic tree transducers
- scientific article; zbMATH DE number 3858450
Cites work
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
- Adding nesting structure to words
- Composition closure of -free linear extended top-down tree transducers
- Composition closure of linear weighted extended top-down tree transducers
- Compositions of extended top-down tree transducers
- Extended multi bottom-up tree transducers
- scientific article; zbMATH DE number 3722133 (Why is no real title available?)
- scientific article; zbMATH DE number 3566209 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 777478 (Why is no real title available?)
- Language prototyping: An algebraic specification approach
- Linear deterministic multi bottom-up tree transducers
- Macro Tree Translations of Linear Size Increase are MSO Definable
- Morphismes et bimorphismes d'arbres
- Origin tracking
- Statistical Machine Translation
- The Power of Extended Top-Down Tree Transducers
- The power of regularity-preserving multi bottom-up tree transducers
- Top-down tree transducers with regular look-ahead
- Transducers with Origin Information
- Tree transformations and dependencies
Cited in
(4)
This page was built for publication: Linking theorems for tree transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628796)