On compositions of clones of Boolean functions

Reference : On compositions of clones of Boolean functions


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Physical, chemical, mathematical & earth Sciences : Mathematics
	To cite this reference:	http://hdl.handle.net/10993/3290

Title :	On compositions of clones of Boolean functions
Language :	English
Author, co-author :	Couceiro, Miguel [University of Tampere, Finland]
	Foldes, Stephan [Tampere University of Technology, Finland]
	Lehtonen, Erkko [Tampere University of Technology, Finland]
Publication date :	2004
Main document title :	International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004)
Editor :	Simos, T.
	Maroulis, G.
Publisher :	VSP/Brill
Pages :	849-851
Peer reviewed :	Yes
On invitation :	No
Audience :	International
ISBN :	9789067644181
Event name :	International Conference Of Computational Methods In Sciences And Engineering (ICCMSE 2004)
Event date :	19-23 November 2004
Event place (city) :	Attica
Event country :	Greece
Keywords :	[en] function class composition ; clones ; Boolean functions ; Post Classes ; class factorization ; normal forms ; DNF ; CNF ; Zhegalkin polynomial ; applications of universal algebra in computer science
Abstract :	[en] We present some compositions of clones of Boolean functions that imply factorizations of ?, the clone of all Boolean functions, into minimal clones. These can be interpreted as representation theorems, providing representations of Boolean functions analogous to the disjunctive normal form, the conjunctive normal form, and the Zhegalkin polynomial representations.
Permalink :	http://hdl.handle.net/10993/3290
Commentary :	International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004)

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Limited access	ICCMSE2004.pdf		Author preprint	177.18 kB	Request a copy

All documents in ORBi^lu are protected by a user license.