DocumentCode
1107893
Title
Associative Algebraic Structures in the Set of Boolean Functions and Some Applications in Automata Theory
Author
Reischer, Corina ; Simovici, Dan A.
Issue
3
fYear
1971
fDate
3/1/1971 12:00:00 AM
Firstpage
298
Lastpage
303
Abstract
A class of linear algebraic structures over the set of Boolean functions is presented. Afterwards, from these structures a new one is studied—the right-weak algebra. By using the properties of this algebra, some new results are established about the commutativity of the superposition, the ideals, the annulators, and the properties of the iteration.
Keywords
Annulators, coincidence, commutative Boolean algebra, ideals, right-weak linear algebra, square root of a Boolean function.; Automata; Boolean algebra; Boolean functions; Calculus; Circuit synthesis; Helium; Linear algebra; Sequential circuits; Switching circuits; Systems engineering and theory; Annulators, coincidence, commutative Boolean algebra, ideals, right-weak linear algebra, square root of a Boolean function.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223234
Filename
1671827
Link To Document