Beynon, Meurig (1984) Replaceability and computational equivalence in finite distributive lattices. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

Preview

PDF WRAP_cs-rr-061.pdf - Other - Requires a PDF viewer. Download (10Mb) | Preview

Request Changes to record.

Abstract

Notions of replaceability and computational equivalence are defined in an abstract algebraic setting, and investigated in detail for finite distributive lattices. It is shown that, when computing an element f of a finite distributive lattice D, the elements of D partition into classes of computationally equivalent elements, and define a quotient of D in which all intervals of the form [t/\f, t\/f] are boolean. This quotient is an abstract simplicial complex with respect to ordering by replaceability. Other results include generalisations and extensions of known theorems concerning replacement rules for monotone boolean networks.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Lattices, Distributive
Series Name:	Department of Computer Science Research Report
Publisher:	University of Warwick. Department of Computer Science
Place of Publication:	Coventry, UK
Official Date:	March 1984
Dates:	Date Event March 1984 Completion
Number:	Number 61
DOI:	CS-RR-061
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Related URLs:	Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads