๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The equivalence of two problems on the cube

โœ Scribed by C Gotsman; N Linial

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
216 KB
Volume
61
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a problem of Yuzvinsky on separating
On a problem of Yuzvinsky on separating the n-cube
โœ D.J. Kleitman ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 474 KB

The following problem of Yuzvinsky is solved here: how many vertices of the n-cube must be removed from it in order that no connected component of the rest contains an antipodal pair of vertices? Some further results and problems are described as well.

The equivalence problem for deterministi
The equivalence problem for deterministic two-tape automata
โœ Malcolm Bird ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 715 KB

A decision procedure is described for equivalence of deterministic two-tape (oneway) automata. ## l. INTRODUCTION The notion of an n-tape (one-way, deterministic) automaton was introduced by Rabin and Scott [2]. Although the properties of these devices have been studied extensively, no answer has