scientific article; zbMATH DE number 4108162
From MaRDI portal
Publication:3832055
Recommendations
Cited in
(13)- Compositions with superlinear deterministic top-down tree transformations
- Linking theorems for tree transducers
- Approximate consistency for transformations on words and trees
- Domains of partial attributed tree transducers
- The Complexity of Tree Transducer Output Languages
- scientific article; zbMATH DE number 5529981 (Why is no real title available?)
- scientific article; zbMATH DE number 5654542 (Why is no real title available?)
- scientific article; zbMATH DE number 1101391 (Why is no real title available?)
- Superlinear deterministic top-down tree transducers
- scientific article; zbMATH DE number 6131600 (Why is no real title available?)
- Modular tree transducers
- A complete classification of deterministic root-to-frontier tree transformation classes
- The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3832055)