Alphabetic tree relations
The alphabetic tree relations studied in this paper are tree transformations defined by bimorphisms (\(\varphi,R,\psi)\) in which \(\varphi\) and \(\psi\) are alphabetic tree homomorphisms and \(R\) is a recognizable tree language. The class Aleph of these tree relations is shown to contain the inverses and the compositions of its members. These transformations also preserve recognizable and algebraic tree languages. Several natural types of tree transformations are shown to be in Aleph and the class is compared with some other classes of tree transformations. A key notion in the paper is a certain join operation for combining ranked alphabets.
- A representation of trees by languages. II
- Actions, finite state sets and applications to trees
- Bottom-up and top-down tree transformations— a comparison
- Forêts Algébriques et Homomorphismes Inverses
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Generalized sequential machine maps
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3594667 (Why is no real title available?)
- scientific article; zbMATH DE number 3601128 (Why is no real title available?)
- scientific article; zbMATH DE number 3441989 (Why is no real title available?)
- IO and OI. I
- Mappings and grammars on trees
- Sur une classe de transformations d'arbres
- Tree transducers and tree languages
- On two families of forests
- Recognizable tree-languages and nonlinear morphisms
- Context-free series on trees
- A survey on decidable equivalence problems for tree transducers
- scientific article; zbMATH DE number 3852459 (Why is no real title available?)
- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
- Properties of quasi-relabeling tree bimorphisms
- scientific article; zbMATH DE number 3905867 (Why is no real title available?)
- Decidability of equivalence for a class of non-deterministic tree transducers
- scientific article; zbMATH DE number 1947386 (Why is no real title available?)
- scientific article; zbMATH DE number 2040925 (Why is no real title available?)
- scientific article; zbMATH DE number 3997186 (Why is no real title available?)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
- Equational tree transformations
- Tree homomorphisms for unranked trees
- Alphabetic and synchronized tree transducers
- Defining syntax-directed translations by tree bimorphisms
This page was built for publication: Alphabetic tree relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193896)
