Searching for "k 1 Heads Are Better than k" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations
by Markus Holzer — in Proc. Mathematical Foundations of Computer Science, 1997, LNCS 1295, Springer-Verlag
… is best possible, because k + 1 heads are better than k as shown in [9, page 69, Theorem 1]. Observe…
Cited by 3 (0 self) – Add To MetaCart

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
by unknown authors
… languages [43, 48]. In fact, it is known that in general k + 1 heads are better than k even for a single…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB