scientific article; zbMATH DE number 475424

zbMath0798.68086MaRDI QIDQ4273671

Max Dauchet, Sophie Tison

Publication date: 13 January 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

closure propertiesmorphismstree languages

Mathematics Subject Classification ID

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

Related Items

Recursively defined tree transductions ⋮ Tree tuple languages from the logic programming point of view ⋮ Pumping, cleaning and symbolic constraints solving ⋮ Compositions of extended top-down tree transducers ⋮ PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS ⋮ Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs. ⋮ Equational tree transformations ⋮ Linear context-free tree languages and inverse homomorphisms