دانشگاه مازندران

 آمار

تعداد نشریات32
تعداد شماره‌ها557
تعداد مقالات5,426
تعداد مشاهده مقاله8,238,511
تعداد دریافت فایل اصل مقاله6,125,259
Hamidi, Mohammad, Rahmati, Marzieh, Mohammadiyeh‎, Seyyed Ali. (1404). S‎witching ‎hypergraphs-‎based‎ decision ‎making‎ and python ‎c‎ode. پژوهشنامه مدیریت اجرایی, 15(1), 30-49. doi: 10.22080/cjms.2025.28230.1735
Mohammad Hamidi; Marzieh Rahmati; Seyyed Ali Mohammadiyeh‎. "S‎witching ‎hypergraphs-‎based‎ decision ‎making‎ and python ‎c‎ode". پژوهشنامه مدیریت اجرایی, 15, 1, 1404, 30-49. doi: 10.22080/cjms.2025.28230.1735
Hamidi, Mohammad, Rahmati, Marzieh, Mohammadiyeh‎, Seyyed Ali. (1404). 'S‎witching ‎hypergraphs-‎based‎ decision ‎making‎ and python ‎c‎ode', پژوهشنامه مدیریت اجرایی, 15(1), pp. 30-49. doi: 10.22080/cjms.2025.28230.1735
Hamidi, Mohammad, Rahmati, Marzieh, Mohammadiyeh‎, Seyyed Ali. S‎witching ‎hypergraphs-‎based‎ decision ‎making‎ and python ‎c‎ode. پژوهشنامه مدیریت اجرایی, 1404; 15(1): 30-49. doi: 10.22080/cjms.2025.28230.1735

S‎witching ‎hypergraphs-‎based‎ decision ‎making‎ and python ‎c‎ode

Caspian Journal of Mathematical Sciences
دوره 15، شماره 1 - شماره پیاپی 29، 2026، صفحه 30-49    اصل مقاله (1.73 M)
نوع مقاله: Research Articles
شناسه دیجیتال (DOI): 10.22080/cjms.2025.28230.1735
نویسندگان
Mohammad Hamidi* 1؛ Marzieh Rahmati1؛ Seyyed Ali Mohammadiyeh‎2
1Department of Mathematics, University of Payame Noor, Tehran, Iran.
2Department of Pure Mathematics, faculty of Mathematical Sciences, University of Kashan, Kashan 87317-53153, I. R.
تاریخ دریافت: 29 آذر 1403،  تاریخ بازنگری: 24 بهمن 1403،  تاریخ پذیرش: 16 آذر 1404 
چکیده
The notion of binary decision trees plays a wide and important role in application software‎, ‎for example‎, ‎it is widely used in computer-aided design applications‎.
‎In this article‎, ‎we present the binary decision hypertree‎, ‎considering the total binary truth table (T.B.T) and the new concepts of hypergraphable Boolean functions and Boolean functionable hypergraphs‎.
‎‎As well as in this study we present the concept of unitors set of switching functions and prove that each T.B.T corresponds to a minimum Boolean phrase according to the unitors set‎
‎and give several clauses in a certain T.B.T to gain the minimum irreducible Boolean phrase of switching functions‎.
‎ ‎Eventually‎, ‎we exhibit an Algorithm and so Python programming (by perfect and basic codes) thus that for each certain T.B.T‎, ‎inset a minimum irreducible switching phrase and so we obtain the binary decision hypertrees‎. ‎The major contribution of this work is to introduce the novel and simple method to the design of reduced ordered binary decision diagrams via the hypergraph(tree)s for the first time in this paper‎.
کلیدواژه‌ها
hypergraphable Boolean function‎؛ ‎Boolean functionable hypergraph‎؛ ‎binary decision (hyper)tree
آمار
تعداد مشاهده مقاله: 72
تعداد دریافت فایل اصل مقاله: 93


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب