scientific article; zbMATH DE number 475424
From MaRDI portal
Publication:4273671
Recommendations
Cited in
(15)- Properties of grammatical codes of trees
- Tree adjoining languages and multipushdown languages
- Recognizable tree-languages and nonlinear morphisms
- Computation tree measurement language (CTML)
- On the complexity of consistent identification of some classes of structure languages
- The Complexity of Tree Transducer Output Languages
- Properties of quasi-relabeling tree bimorphisms
- On the Complexity of the Syntax of Tree Languages
- Pumping, cleaning and symbolic constraints solving
- Manipulating tree tuple languages by transforming logic programs
- Some results on top-context-free tree languages
- Recursively defined tree transductions
- Equational tree transformations
- Tree tuple languages from the logic programming point of view
- Compositions of extended top-down tree transducers
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 Q4273671)