Terms considered as trees are very useful tools for presentation and manipulation of different data structures in Computer Science and Information Technology. Any work of the computer over the trees, for instance as graphical user interface (menus of the different windows), XML documents, definitions and description of hierarchial objects in C++ or Java programming etc. can be considered as run...

Caption text or superimposed text provides valuable information about contents in images and video sequences. In this paper, on one hand we present a general overview about text features and a classification of its extraction methods, and on the other hand we introduce our tree structure-based bottom-up approach to text extraction showing some promising results. The purpose of this work is to d...

We present an approach to obtain language models from a tree corpus using probabilistic regular tree grammars (prtg). Starting with a prtg only generating trees from the corpus, the prtg is generalized step by step by merging nonterminals. We focus on bottom-up deterministic prtg to simplify the calculations.

This paper describes a method of generating a reduced phoneme set for dialogue-based computer assisted language learning (CALL) systems. We designed a reduced phoneme set consisting of classified phonemes more aligned with the learners’ speech characteristics than the canonical set of a target language. This reduced phoneme set provides an inherently more appropriate model for dealing with misp...

We give a new version of fuzzy alternating Büchi automata over distributive lattices: weights are putting in every leaf node of run trees rather than along with edges from every node to its children. Such settings are great benefit to obtain complement just by taking dual operation and replacing each final weight with its complement. We prove that L-fuzzy nondeterministic Büchi automata have th...

As an alternative to the two classical proofs for complemen-tation of B uchi automata, due to B uchi himself and to McNaughton, we outline a third approach, based on stratiied alternating automata with a \weak" acceptance condition. Building on work by Muller, Saoudi, Schupp (1986) and Kupferman and Vardi (1997), we present a streamlined version of this complementation proof. An essential point...

We present an algebra whose operations act on musical pieces, and show how this algebra can be used to generate music in a tree-based fashion. Starting from input which is either generated by a regular tree grammar or provided by the user via a digital keyboard, a sequence of top-down tree transducers is applied to generate a tree over the operations provided by the music algebra. The evaluatio...

Abstract We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A automaton a weighted over semiring. called if number of accepting runs on every bounded by global constant. The asks whether given automaton, there exist many deterministic automata whose pointwise maximum equivalent to automaton.

In this article, we develop a new and somewhat unexpected connection between higher-order model-checking and linear logic. Our starting point is the observation that once embedded in the relational semantics of linear logic, the Church encoding of a higher-order recursion scheme (HORS) comes together with a dual Church encoding of an alternating tree automata (ATA) of the same signature. Moreov...

In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST) in two steps: (i) a bottom-up phase to construct a binary tree of shortest-distance feasible regions which represent the loci of possible placements of clock entry points, and (ii) a top-down phase to determine the ex...