. . qx1)??0.
Therefore, query q1q2 . . . qx is also an idle query.
When CQ has two bit strings corresponding to the pair of child nodes which have the
transformed types after an identi?¬?cation frame, the reader deletes q1q2 . . . qx0 and q1q2 . . . qx1
from CQ and enqueues q1q2 . . . qx into CQ. The reader deletes all transformed queries from
CQ recursively. As the query deletion replaces two bit strings with their common pre?¬?x in
CQ, AQS can recognize all tags with less idle queries.
Consider that tag 0110 moves to the contrary direction of the reader and ?¬?nally crosses
over the boundary of the identi?¬?cation area of the reader after tag identi?¬?cation illustrated
in Figure 8.4. In the following frame, query 011 changes into the idle query from the
readable query. Figure 8.5 shows the operation of the query deletion procedure after tag
0110 becomes the leaving tag. Since query 010 is a readable query and query 011 is an idle
query, query 01 is substituted for queries 010 and 011. The query deletion is implemented
once more because query 00 is an idle query and the newly inserted query 01 is a readable
query. The reader deletes queries 00 and 01 from CQ, and inserts query 0 into CQ.
Eventually, CQ has three queries, 0, 10, and 11, and the reader can recognize tags 0101,
1001, and 1101 with these queries.
FIGURE 8.5
Query deletion procedure after tag 0110 went out of
the reader??™s reading range.
Pages:
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300