| Z. Dang, O. H. Ibarra, and Z. Sun. On the emptiness problems for two-way nondeterministic finite automata with one reversal-bounded counter. In ISAAC'02, volume 2518 of Lecture Notes in Computer Science, pages 103--114. Springer, 2002. |
No context found.
Z. Dang, O. H. Ibarra, and Z. Sun. On the emptiness problems for two-way nondeterministic finite automata with one reversal-bounded counter. In ISAAC'02, volume 2518 of Lecture Notes in Computer Science, pages 103--114. Springer, 2002.
No context found.
Z. Dang, O. H. Ibarra, and Z. Sun. On the emptiness problems for two-way nondeterministic finite automata with one reversal-bounded counter. In ISAAC'02, volume 2518 of LNCS, pages 103--114. Springer, 2002.
....Theorem 1. There is a fixed r such that the emptiness problem for 2DCM(2,r) over bounded languages is undecidable. We will also need the following results. Theorem 2. The emptiness problem is decidable for the following machine classes: a) 2DCM(1) 18] b) 2NCM(1) over a bounded language [8], c) 2NCM(c) over a unary alphabet (i.e. over a bounded language on 1 letter) for every c [18] and (d) finite crossing 2NCM(c) for every c [17, 15] Let Y be a finite set of variables over integers. For all integers a y , with y 2 Y , b and c (with b 0) y2Y a y y c is an atomic linear ....
Z. Dang, O. Ibarra, and Z. Sun. On the emptiness problems for two-way nondeterministic finite automata with one reversal-bounded counter. Submitted, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC