Information Technology Business
Welcome to VerticalNews!
We're a pay-per-view site for premium content. If you'd like to purchase this article, it's only $3.00.
Study data from University of Milan update understanding of information technology
May 26th, 2009
"In this paper we consider the classes REC1 and UREC1 of unary picture languages that are tiling recognizable and unambiguously tiling recognizable, respectively. By representing unary pictures by quasi-unary strings we characterize REC1 (resp," scientists in Milan, Italy report.
"UREC1) as the class of quasi-unary languages recognized by nondeterministic (resp. unambiguous) linearly space-bounded one-tape Turing machines with constraint on the number of head reversals. We apply such a characterization in two directions. First we prove that the binary string languages encoding tiling recognizable unary square languages lies between NTIME (2(n)) and NTIME (4(n)); by...
Click here for more articles from Information Technology
Source: Information Technology Business (2009-05-26)