✦ LIBER ✦

Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

✍ Scribed by S. Amoroso; Y.N. Patt

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 591 KB
Volume: 6
Category: Article
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(72)80013-8

No coin nor oath required. For personal study only.

✦ Synopsis

After demonstrating the existence of nontrivial information lossless parallel maps on one-dimensional iterative array configurations, algorithms are presented for deciding the injectivity or surjectivity of the global maps given their defining local maps. Whether or not these properties are independent of neighborhood interconnection patterns is also considered.

📜 SIMILAR VOLUMES

Injectivity and surjectivity of parallel

Injectivity and surjectivity of parallel maps for cellular automata

✍ Akira Maruoka; Masayuki Kimura 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 992 KB

Decision procedures for elementary subla

Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions

✍ M. Breban; A. Ferro; E. G. Omodeo; J. T. Schwartz 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 801 KB

In this paper we describe a simple semi-decision algorithm applicable to a wide class of quantified formulas. The formulas we consider are built using the propositional connectives from prenex formulas in a language for which a decision algorithm for the corresponding quantifier-free theory T is ava