scientific article; zbMATH DE number 475424

MaRDI QIDQ4273671zbMATH OpenFDO

Authors Max Dauchet, Sophie Tison

Publication date 13 January 1994

zbMATH Keywords

closure propertiesmorphismstree languages

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Formal languages and automata (68Q45)

Recommendations

• On the Complexity of the Syntax of Tree Languages
• scientific article; zbMATH DE number 1456959
• Classes of tree languages and DR tree languages given by classes of semigroups
• scientific article; zbMATH DE number 1494251
• Recognizable tree-languages and nonlinear morphisms

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)
• scientific article; zbMATH DE number 1670715 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1456959 (Why is no real title available?)
• 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)