آمار

تعداد نشریات7
تعداد شماره‌ها399
تعداد مقالات5,389
تعداد مشاهده مقاله5,288,207
تعداد دریافت فایل اصل مقاله4,882,946
Hamidi, Mohammad, Rahmati, Marzieh. (1403). On binary decision hypertree (hyperdiagram). نشریه مهندسی عمران امیرکبیر, 5(2), 117-130. doi: 10.22060/ajmc.2023.21639.1094
Mohammad Hamidi; Marzieh Rahmati. "On binary decision hypertree (hyperdiagram)". نشریه مهندسی عمران امیرکبیر, 5, 2, 1403, 117-130. doi: 10.22060/ajmc.2023.21639.1094
Hamidi, Mohammad, Rahmati, Marzieh. (1403). 'On binary decision hypertree (hyperdiagram)', نشریه مهندسی عمران امیرکبیر, 5(2), pp. 117-130. doi: 10.22060/ajmc.2023.21639.1094
Hamidi, Mohammad, Rahmati, Marzieh. On binary decision hypertree (hyperdiagram). نشریه مهندسی عمران امیرکبیر, 1403; 5(2): 117-130. doi: 10.22060/ajmc.2023.21639.1094

On binary decision hypertree (hyperdiagram)

AUT Journal of Mathematics and Computing
مقاله 4، دوره 5، شماره 2، 2024، صفحه 117-130    اصل مقاله (855.68 K)
نوع مقاله: Original Article
شناسه دیجیتال (DOI): 10.22060/ajmc.2023.21639.1094
نویسندگان
Mohammad Hamidi* ؛ Marzieh Rahmati
Department of Mathematics, University of Payame Noor, Tehran, Iran
چکیده
In computer science, a binary decision diagram is a data structure that is used to represent a Boolean function and to consider a compressed representation of relations. This paper considers the notation of T.B.T (total binary truth table), and introduces a novel concept of binary decision (hyper)tree and binary decision (hyper)diagram, directly and in as little time as possible, unlike previous methods. This study proves that every T.B.T corresponds to a binary decision (hyper)tree via minimum Boolean expression and presents some conditions on any given T.B.T for isomorphic binary decision (hyper)trees. Finally, for faster calculations and more complex functions, we offer an algorithm and so Python programming codes such that for any given T.B.T, it introduces a binary decision (hyper)tree.
کلیدواژه‌ها
Minimum Boolean function؛ Binary decision hypertree؛ Binary decision hyperdiagram؛ Unitor
مراجع
  1. Berge, Graphs and hypergraphs, North-Holland Mathematical Library, Vol. 6, North-Holland Publishing Co., Amsterdam-London; American Elsevier Publishing Co., Inc., New York, 1973. Translated from the French by Edward Minieka.
  2. Hamidi and A. Broumand Saeid, On derivable trees, Trans. Comb., 8 (2019), pp. 21–43.
  3. Hamidi, M. Rahmati, and A. Rezaei, Switching function based on hypergraphs with algorithm and python programming, J. Intell. Fuzzy Syst., 39 (2020), pp. 2845–2859.
  4. Hamidi and A. B. Saeid, Accessible single-valued neutrosophic graphs, J. Appl. Math. Comput., 57 (2018), pp. 121–146.
  5. Hamidi and A. B. Saeid, Achievable single-valued neutrosophic graphs in wireless sensor networks, New Math. Nat. Comput., 14 (2018), pp. 157–185.
  6. Hamidi and F. Smarandache, Single-valued neutrosophic directed (hyper)graphs and applications in networks, J. Intell. Fuzzy Syst., 37 (2019), pp. 2869–2885.
  7. Molnar´ , Applications of hypergraphs in informatics: a survey and opportunities for research, Ann. Univ. Sci. Budap. Rolando E¨otv¨os, Sect. Comput., 42 (2014), pp. 261–282.
  8. E. Whitesitt, Boolean algebra and its applications, Dover Publications, Inc., New York, 1995. Reprint of the 1961 original.
آمار
تعداد مشاهده مقاله: 422
تعداد دریافت فایل اصل مقاله: 211


سامانه مدیریت نشریات علمی. طراحی و پیاده سازی از سیناوب