We prove the following four results on communication complexity: 1) For every k ≥ 2, the language L<subscrpt>k</subscrpt> of encodings of directed graphs of out degree one that contain a path of length k+1 from the first vertex to the last vertex and can be recognized by exchanging O(k log n) bits using a simple k-round protocol requires exchanging… (More)
We define a language L and show that is <underline>cannot</underline> be recognized by any two way deterministic counter machine. It is done by fooling any given such machine; i.e. showing that if it accepts L' @@@@ L, then L'-L @@@@ &fgr;. For this purpose, an argument stronger than the well known crossing sequence argument needs to be introduced. Since L… (More)
It is known that k tapes are no better than two tapes for nondeterministic machines. We show here that two tapes are better than one. In fact, we show that two pushdown stores are better than one tape. Also, k tapes are no better than two for nondeterministic reversal-bounded machines. We show here that two tapes are better than one for such machines. In… (More)
We prove the following lower bounds for <underline>on line</underline> computation. 1) Simulating two tape <underline>nondeterministic</underline> machines by one tape machines requires Ω(n log log n) time. 2) Simulating k tape (deterministic) machines by machines with k pushdown stores requires Ω(n log<supscrpt>1/(k+1)</supscrpt>n) time.
The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterministic machines by one-tape machines requires I2(n log n) time. (2) Simulating k-tape (deterministic) machines by machines with k-pushdown stores requires Q(n log 1/~k+ 1)n) time.