Properties of quasi-alphabetic tree bimorphisms

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited

Quasi-alphabetic tree bimorphisms [Steinby and Tîrn uc : Syntax-Directed Translations and Quasi-Alphabetic Tree Bimorphisms. Proc. CIAA, LNCS 4783:265 276, 2007] are reconsidered. It is known that the class of (string) translations de ned by such bimorphisms coincides with the class of syntax-directed translations. This result is extended to a smaller class of tree bimorphisms namely (linear an...

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms

Properties of Quasi-Relabeling Tree Bimorphisms

The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (φ,L, ψ), where φ and ψ are quasi-relabeling tree homomorphisms and L is a regular tree language. Such relations admit a canonical representation, which immediately also yields that QUASI is closed under nite union. Howe...

Alphabetic Trees Enumeration and Optimization with applications to VLSI design

Alphabetic trees are trees without any internal edge crossing despite an imposed total order on their leaf nodes This paper presents a systematic procedure for generating all alphabetic trees on a given number of leaf nodes under bounded degree and or bounded height criteria The number of such trees is calculated and used to derive upper bounds on the complexity of the corresponding alphabetic ...

Synchronous Grammars as Tree Transducers

Tree transducer formalisms were developed in the formal language theory community as generalizations of finite-state transducers from strings to trees. Independently, synchronous tree-substitution and -adjoining grammars arose in the computational linguistics community as a means to augment strictly syntactic formalisms to provide for parallel semantics. We present the first synthesis of these ...