Index
Note: Page numbers followed by f indicate material in figures.
A
a posteriori probability, 341
a priori probability, 341
AA. See assignment axiom
AAA. See array assignment axiom
Abel’s summation transformation, 303
absorption laws
Boolean algebra, 638
logic, 420
abstract algebra, 621
axioms for, 623
abstract data type, 656–671
binary tree, 667–668
data structures, 660–669
lists, 661–662
natural numbers, 657–660
priority queue, 668–669
queues, 664–666
stack, 662–664
accept, 749, 750, 752, 802, 804, 805, 835
accumulating parameters, 285
Ackermann, W., 468–469
Ackermann’s function, 284, 854
acyclic graph, 695
acyclic transitive closure, 608
addition rule (add), 439
additive cipher, 119
address polynomials, 46
adequate complete, ...
Get Discrete Structures, Logic, and Computability, 4th Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.