News Column

Reports from Technical University Add New Data to Findings in Information Technology (Forward and backward application of symbolic tree transducers)

August 19, 2014

By a News Reporter-Staff News Editor at Information Technology Newsweekly -- Current study results on Information Technology have been published. According to news reporting originating in Dresden, Germany, by VerticalNews journalists, research stated, "We consider symbolic tree automata (sta) and symbolic regular tree grammars and their corresponding classes of tree languages: s-recognizable tree languages and s-regular tree languages. We prove that the following three classes are equal: the class of s-recognizable tree languages, the class of s-regular tree languages, and the class of images of classical recognizable tree languages under tree relabelings."

The news reporters obtained a quote from the research from Technical University, "Moreover, the sta and the recently introduced variable tree automata are incomparable with respect to their recognition power. Also, we consider symbolic tree transducers (stt) and prove the following theorems. The syntactic composition of two stt computes the composition of the tree transformations computed by each stt, provided that (1) the first one is deterministic or the second one is linear and (2) the first one is total or the second one is nondeleting. Backward application of an stt to any s-recognizable tree language yields an s-recognizable tree language. There is a linear stt of which the range is not an s-recognizable tree language. Forward application of simple and linear stt preserves s-recognizability. A restricted version of both the type checking problem of simple and linear stt, and the inverse type checking problem of arbitrary stt is decidable."

According to the news reporters, the research concluded: "Since we deal with trees over infinite alphabets, we require appropriate conditions on sta and stt such that all the proofs are constructive."

For more information on this research see: Forward and backward application of symbolic tree transducers. Acta Informatica, 2014;51(5):297-325. Acta Informatica can be contacted at: Springer, 233 Spring St, New York, NY 10013, USA. (Springer -; Acta Informatica -

Our news correspondents report that additional information may be obtained by contacting Z. Fulop, Technical University of Dresden, Fac Comp Sci, D-01062 Dresden, Germany.

Keywords for this news article include: Europe, Dresden, Germany, Information Technology

Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC

For more stories covering the world of technology, please see HispanicBusiness' Tech Channel

Source: Information Technology Newsweekly

Story Tools Facebook Linkedin Twitter RSS Feed Email Alerts & Newsletters