Associative Algebraic Structures in the Set of Boolean Functions and Some Applications in Automata Theory

1971 ◽  
Vol C-20 (3) ◽  
pp. 298-303 ◽  
Author(s):  
C. Reischer ◽  
D.A. Simovici
Author(s):  
Smile Markovski ◽  
Verica Bakeva ◽  
Vesna Dimitrova ◽  
Aleksandra Popovska-Mitrovikj

1987 ◽  
Vol 109 (3) ◽  
pp. 213-218 ◽  
Author(s):  
S. H. Kim ◽  
N. P. Suh

For the field of manufacturing to become a science, it is necessary to develop general mathematical descriptions for the analysis and synthesis of manufacturing systems. Standard analytic models, as used extensively in the past, are ineffective for describing the general manufacturing situation due to their inability to deal with discontinuous and nonlinear phenomena. These limitations are transcended by algebraic models based on set structures. Set-theoretic and algebraic structures may be used to (1) express with precision a variety of important qualitative concepts such as hierarchies, (2) provide a uniform framework for more specialized theories such as automata theory and control theory, and (3) provide the groundwork for quantitative theories. By building on the results of other fields such as automata theory and computability theory, algebraic structures may be used as a general mathematical tool for studying the nature and limits of manufacturing systems. This paper shows how manufacturing systems may be modeled as automatons, and demonstrates the utility of this approach by discussing a number of theorems concerning the nature of manufacturing systems. In addition symbolic logic is used to formalize the Design Axioms, a set of generalized decision rules for design. The application of symbolic logic allows for the precise formulation of the Axioms and facilitates their interpretation in a logical programming language such as Prolog. Consequently, it is now possible to develop a consultive expert system for axiomatic design.


2019 ◽  
Vol 6 (2) ◽  
pp. 90-94
Author(s):  
Hernandez Piloto Daniel Humberto

In this work a class of functions is studied, which are built with the help of significant bits sequences on the ring ℤ2n. This class is built with use of a function ψ: ℤ2n → ℤ2. In public literature there are works in which ψ is a linear function. Here we will use a non-linear ψ function for this set. It is known that the period of a polynomial F in the ring ℤ2n is equal to T(mod 2)2α, where α∈ , n01- . The polynomials for which it is true that T(F) = T(F mod 2), in other words α = 0, are called marked polynomials. For our class we are going to use a polynomial with a maximum period as the characteristic polyomial. In the present work we show the bounds of the given class: non-linearity, the weight of the functions, the Hamming distance between functions. The Hamming distance between these functions and functions of other known classes is also given.


Author(s):  
Yu ZHOU ◽  
Wei ZHAO ◽  
Zhixiong CHEN ◽  
Weiqiong WANG ◽  
Xiaoni DU

Sign in / Sign up

Export Citation Format

Share Document