Author name cluster
Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.
TCS Journal 1994 Journal Article
We present an algorithm to perform template matching of an N × N image with an M × M template on a (log N + 1)-levels pyramid computer. The time complexity of the algorithm is upper bounded by α log N + βM 2, where α and β are constants.
TCS Journal 1991 Journal Article
We introduce various types of top-down and bottom-up generalized automata on infinite trees. We study the power of deterministic and nondeterministic generalized tree automata and prove that deterministic and nondeterministic bottom-up automata accept the same class. We prove also that nondeterministic top-down and bottom-up generalized automata have the same power. We give various characterizations of the monadic second order theory of the tree in terms of tree automata and tree grammars. We consider different types of extensions of Muller-McNaughton's Theorem. But, unfortunately not all the extensions of it are possible.
I&C Journal 1989 Journal Article
We introduce various types of ω-automata, top-down automata and bottom-up automata on infinite trees. We study the power of determinstic and nondeterministic tree automata and prove that deterministic and non-deterministic bottom-up tree automata accept the same infinite tree sets. We establish a relationship between tree automata, Logic programs, recursive program schemes, and the monadic second-order theory of the tree. We prove that the equivalence of two rational logic programs is decidable.