✦✦✦

✦ Index

A ANSI
See American National Standards In-
Abstract data type 261, 307 stitute
See also Dictionary, Priority queue, ANSI C
Queue, Stack See C
Abstract symbol 593–594 Anti-implicant 668
Abstraction 1, 3 Antisymmetry 388–390
Abstraction (of sets) 338–339 Arc 452, 488
Acceptance, of input 533, 539 Argument size
Accepting state 532, 549 See Size of arguments
Activation record 313 Arithmetic expression 46–50, 62–63, 242–
Acyclic graph 454 244, 592, 611–615
Acyclic path 456 Arithmetic operator 18–19, 109
Addition 10–12, 716–723 Arithmetic series 42
See also One-bit adder, Ripple-carry Arity 366
addition Array 14, 109, 232, 301–306, 308–309, 329–
Adjacency list 459–461, 463 333, 358–360
Adjacency matrix 460–462, 515 See also Adjacency matrix, Charac-
Adjacent nodes 456 teristic vector, Circular array, Heap
ADT (data structure)
See Abstract data type ASCII 38
Aho, A. V. 155, 335, 450, 527, 589, 641 Assignment (of values to objects) 157–160
Aleph-zero Assignment-statement 19, 109
Associative law 47, 344–345, 441, 570, 652,
See Countable set
675
Algebra 5, 343
See also Nonassociative operator
See also Algebraic law, Expression,
Astrahan, M. M. 450
Propositional logic, Regular expres-
Atom 338
sion, Relational algebra, Set algebra
Atomic formula 735
Algebraic law
Attribute 404, 414
See Associative law, Commutative
Automaton 530–556, 571–590, 637–639,
law, Distributive law, Idempotence,
704
Identity
See also Deterministic automaton,
Algol 641
ǫ-automaton, Nondeterministic au-
Algorithm 4–5, 20
tomaton
Alphabetic order
Average-case running time 93, 215–216,
See Lexicographic order 270–271
Ambiguous grammar 610–616 See also Running time
American National Standards Institute 24 Awk 450, 566
Anagram 178
See also Partial anagram B
Ancestor 226, 254
See also Lowest common ancestor Backus, J. W. 641
AND 10, 644, 649, 651–652, 657, 675–679, Backus-Naur form
688, 700, 740, 756–757 Backward arc 488, 494
Annihilator 570, 675–676 Backward induction 72

776
INDEX 777

Bag C
See Multiset
Balanced parentheses 64–68, 594–596, 610– C 3, 7, 13–20, 22–23, 25, 64, 265, 312, 368,
611 562, 741–742, 758
Bar-Hillel, Y. 641 Call by reference 265
Calling graph 129–130, 455
Basis 28, 35, 44–46, 59, 132
Cantor, G. 402
Bayes’ rule 202
Car 290
Bell curve 175–176
Carry 10
Bellman, R. E. 335 Carry-in/out 656
Benchmarking 91 Carry-propagate/generate 717–720
Berge, C. 527 Cartesian product 367–368
Berlekamp, E. R. 88 Case analysis 683
Big-oh 96–109, 303, 355 Cdr 290
Bin 181 Cell 7, 23, 293
Binary operator 50 Chamberlin, D. D. 450
Binary relation 366, 380–396 Character 13
Binary search 304–305 Character class 565
Character string 287, 327–333
Binary search tree 258–271
Characteristic vector 357–360, 376, 379,
Binary search tree property 259
383–384
Binary tree 253–258
Child 224, 254
See also Binary search tree, Partially See also Left child, Right child
ordered tree Chip 523, 711, 731
Binomial coefficient 176 Chomsky, N. 641
Bipartite graph 524 Chromatic number 524
Bit 10, 159 Chuck-a-Luck 182
Blackjack 187 Circuit 523
Block 110–111, 114–115, 117, 122–123, 597 See also Logic circuit
Block, of a program Circuit delay 711, 721, 727–728
BNF Circular array 320–321
See Backus-Naur form Clarity 90
Body, of a production 593 Class
See Abstract data type
Body, of a rule 763
Clause 692, 738
See also Hypothesis
Clear (operation on stacks, queues) 307–
Boole, G. 698 308, 318
BOOLEAN 22 Clique 525
Boolean algebra 5, 642 Closed expression 755
Boolean function 647–648, 655–660 Closure 393–395, 560–561
Borodin, A. B. 155 See also Connected component, Topo-
Bounce filter 533–535 logical sorting, Transitive closure
Bound variable 741–744 Codd, E. F. 450
Branching factor 232 Coersion 20
Break Coloring 524–525
Combinational circuit 702
See Jump-statement
Combinations 171–178, 258
Bridge 187
Combinatorics 156–187
Brooks, F. P. 24
Common subsequence 321
BST See also LCS
See Binary search tree Commutative law 47, 344, 441–442, 570,
Bubbledown 276, 508–509 674–675
Bubbleup 274–276, 508–509 Comparable elements 390
Bucket 362 Comparison operator 19, 109
778 INDEX

Compiler 96 Cyclic graph 454

See also Lexical analysis, Parsing
Complement event 192 D
Complete binary tree
See Full binary tree Data model 3–4, 6–20
Complete graph 522 Data object 6
Complete induction 44–51 Data structure 4–5, 8, 20
Complete proof procedure 695 Database 403, 406
Complete set of operators 659 Database scheme 406–407, 410
Complete tree Dead state 555
See Full tree Declared domain/range 369
Complex number 340 Decrement 19
Component, of a tuple 366 Deduction 686–692
Compound event 208–209 DefCell 23
Compound statement 114 Defensive programming 71, 117, 246
See also Statement Defined constant 22
Concatenation 7, 291, 558–559, 569–570 Degree, of a node 252, 462
Conclusion 686 Degree, of a relation
See also Head, of a rule See Arity
Concordance 328 Delete 378, 380, 384, 407, 417–418
Conditional Deletemax 271, 276–279
See If-statement Deletemin 264–266
Conditional probability 193–202 Deletion 264–266, 291, 295–297
Conjunction 658 DeMorgan’s laws 677–678
Conjunction of events 207–208 Dense graph 461
See also Compound event Depth, of a node 226, 254
Conjunctive normal form Depth-first search 484–501
See Product of sums Depth-first search forest 489–490
Connected component 224, 394–395, 466– Depth-first search tree 486–489
478, 499–500 Dequeue 318
Connected graph 466 Dereferencing 7
Consistent proof system 770 Descendant 226, 254
Constant Deterministic algorithm 216
See Defined constant Deterministic automaton 537, 547–556
Constant factor 98 Dewdeney, A. K. 222
Constant time 103 Diagonalization 399–400
Containment Dictionary 259, 274, 293, 351, 363–365, 386
See Subset See also Deletion, Insertion, Lookup
Containment, of sets 347–349 Dictionary order
Context-free grammar See Lexicographic order
See Grammar Diff 321
Continue Difference 342, 345, 352, 356, 429–430, 436,
See Jump-statement 441
Contradiction 684–685, 695–696 See also Symmetric difference
Contrapositive 683–684 Digital circuit
Conway, L. 732 See Logic circuit
Cook, S. A. 698 Dijkstra, E. W. 527
Countable set 399 Dijkstra’s algorithm 502–513
Course-conflict graph Direct recursion 69, 455
Cover 662 Directed graph 452–456, 702–703
Cross arc 488, 490, 494 Directory 8
Cryptography 219 Disjoint sets 539
Current domain/range 369 Disjunction 658
Cycle 453, 456–458, 495–498 See also Clause
INDEX 779

Disjunction of events 205–207 Equivalence (operator) 651, 674

See also Compound event Equivalence relation 391–393
Disjunctive normal form Error-detecting code 38–40
See Sum of products Euler circuit 484
Distance 502 Even parity
Distribution 181–184 See Parity bit
Distributive law 197–200, 344–345, 675– Event 188
676 See also Compound event, Conjunc-
Divide and conquer 75, 714, 716–722, 724– tion of events, Disjunction of events,
730 Implication of events, Reinforcing
Domain 368, 414, 745 events
See also Current domain/range, De- Exam scheduling 1–2, 524–525
clared domain/range Excluded middle 682–685
Doubly linked list 299–300 Exclusive or 655
Do-while statement Existential quantifier 739, 750, 755–758
See While-statement Expected value 212–214
Duality 678–679 Experiment 188
Duplicates, on list 296–298 Exponential time 102–103
Dynamic aspects of data model 6 Expression
Dynamic programming 323–324
See Arithmetic expression, Closed ex-
pression, Infix expression, Logical ex-
E
pression, Postfix expression, Prefix
expression, Quantifier-free expression,
Edge 224, 456
Rectified expression, Regular expres-
Editor
sion
See Text editor
Expression tree 228–230, 242–244, 434
Efficiency 90–91, 95
See also Running time
F
Egrep 546, 564, 567
Empty list 288, 291 Fact 763
Empty set 338, 345–346, 557, 559, 570
Factor 613
∅-free regular expression 571
Factorial 57, 60, 170
Empty stack 307–308
Fair game 214
Empty string 29, 557, 559, 570, 594
FALSE 22
Empty tree 254–255
Fan-in/out 712–714
Enderton, H. B. 698, 775
Feature size 711
Endmarker 331, 618
Feigenbaum, E. A. 335
Enqueue 318
Entailment 769 Feller, W. 221–222
Enumeration 13 Fermat’s theorem 219
EOF 13, 23 Fibonacci number 135
ǫ Field 14
See Empty string File 8
ǫ-automaton 572–581 Find (component of a node) 470–475
Equality, of sets 339 Finite automaton
Equipotence 396 See Automaton
Equivalence class 392, 467 First 292
Equivalence, of automata 547 First-order logic
Equivalence, of cycles 454, 457 See Predicate logic
Equivalence, of expressions 344, 346–347, Fischer, M. J. 335–336
752 Floating-point number
Equivalence, of regular expressions 568– See Real number
569 Floyd, R. W. 285, 527
Equivalence, of states 555 Floyd’s algorithm 513–521
780 INDEX

For all H
See Universal quantifier
For-statement 111–112, 115, 117, 121–122, Halmos, P. R. 402
129 Hash function 362
Fortran 641 Hashing 360–366, 376–379, 384, 409
Head, of a list 288
Forward arc 488, 494
See also Car
Fredkin, E. 285
Head, of a production 593
free 18 Head, of a rule 763
Free variable 741–744 See also Conclusion
Friedman, A. D. 732 Head, of an arc 452–453
Front 318 Heap (data structure) 273–279
Full binary tree 257, 269–270 Heapify 281–282
Full stack 307–308 Heapsort 280–284
Full tree Height 226, 244–247, 254, 472–473
Function 17–18, 69, 127–136, 312–318, Held, G. 450
370–380 Hennessy, J. L. 732
Hopcroft, J. E. 155, 335, 527, 589, 641
See also Boolean function, Monotone
Huffman, D. A. 589
function
Hunt, J. W. 335
Fuzzy logic 211
Hypothesis 686
See also Body, of a rule
G
I
Garey, M. R. 698
Gate 9–10, 700–701 Idempotence 346, 570, 676
GCD Identifier 17
See Greatest common divisor Identity 292, 345, 569, 675
Genesereth, M. R. 698 If-statement 112–114, 117, 122, 129, 597,
Geometric series 42 643
Global variable 22, 741 Implicant 661, 665
See also Static variable Implication 650, 652, 679
Implication of events 209–210
Godel, K. 770, 775
Important state 579
Goto
Incommensurate functions 108
See Jump-statement Incompleteness theorem 770–771
Graham, R. L. 155, 221–222 Increment 19
Grammar 591–641 In-degree 462
Graph 369, 451–528, 531 Independent experiments 195–197, 200–
See also Acyclic graph, Bipartite 201
graph, Calling graph, Course-conflict Index 425–426
graph, Directed graph, Planar graph, See also Primary index, Secondary in-
Reduced graph, Undirected graph dex
Greatest common divisor 74–75 Index-join 438–439
Greedy algorithm 481 Indirect recursion 69, 455
Green, B. F. 335 Induction 27, 34–51, 253
Grep See also Backward induction, Com-
plete induction, Structural induction
See Egrep
Inductive assertion
Ground atomic formula 735 See Loop invariant
Ground literal 736 Inductive definition
Growth rate 99 See Recursive definition
See also Big-oh Inductive hypothesis 35
Guessing a solution 148–152 Inductive step 28, 35, 44, 59, 132
INDEX 781

Inference rule 686 L

Infinite set 189, 340, 396–401, 601
Infix expression 243 Label 453, 463–465, 536
Infix operator 63, 368 Labeled tree 228
Ingres 450 Language 557, 572, 599–602
Injection 371 Last 292
Inorder 258 Last-in-first-out list
Input, circuit 701, 723 See Stack
Input cursor 618 Lawler, E. 527–528
Input sequence 533 LCS 321–327
Leaf 226, 254
Insert 378, 380, 384, 407, 417–418
Left child 253
Insertion 262–263, 271, 276, 291, 296, 363–
Left-factoring 632–633
365
Leftmost child 235–238
Integer 13
Left-recursion elimination 631–632
See also Natural number
Length, of a list 292
Interior node 226, 254
Length, of a path 225, 254, 453, 456
Interpretation 745–751, 769
Level 226
Intersection 342, 344, 346, 352, 356, 429– Lewis, H. R. 698, 775
430, 436, 441, 654 Lewis, P. M. 641
Intractable problem 673 Lex 565
Inverse relation 373, 388 Lexical analysis 564–565
Inverter 700 Lexicographic order 29, 61–62
IPL-V 335 Library function 109
IsEmpty (operation on stacks, queues) 292, LIFO list
308, 318 See Stack
IsFull (operation on stacks, queues) 308, Line beginning/ending 565–566
318 Linear search 115, 302
Iteration 25, 27–34 Linear time 92, 103
Linked list 7, 293–301, 310–311, 318–320,
J 330–331, 375, 381–383
See also Adjacency list
Johnson, D. S. 698 Lisp 5, 335
Join 432–433, 437–441 List 7, 286–336, 339, 351–357
Joint probability space 195 See also Doubly linked list, Linked
Jump-statement 110, 117 list, Queue, Stack
Literal 658, 736
K Liu, C.-L. 221–222
LL parser
Karnaugh map 660–669
See Table-driven parser
Karp, R. M. 698 Local variable 741
Keno 190–192 Locality 92
Kernighan, B. W. 24, 450 See also 90-10 rule
Key 32, 411–414, 421 Logarithmic time 103, 106
Kleene closure Logic
See Closure See Predicate logic, Propositional
Kleene, S. C. 589–590 logic
Knowledge representation 3 Logic circuit 9–12, 701–731
Knuth, D. E. 88, 155, 221–222, 285, 335, Logical expression 645–648, 653, 655–660,
402, 641 705–710, 736–738
Kreps, P. 450 Logical operator 19, 109
Kruskal, J. B. 527 Longest common subsequence
Kruskal’s algorithm 479–483 See LCS
Kuratowski’s theorem 523 Lookahead symbol 624
782 INDEX

Lookup 260–262, 291, 294–298, 302–305, Multiway merge sort 82

378–379, 381–384, 408, 417–418, 460– Munro, I. 155
461 MUX
Loop 453 See Multiplexer
Loop invariant 52
Lowest common ancestor 238 N
Low-order term 98
LR parsing 641 Name 7, 17
NAND 651–652, 659, 700
M
Natural join 433
Machine instruction 96 Natural number 340, 396–397
Macintosh 8 Naur, P. 641
Majority function 704, 730 Navigation 423–428
malloc 18 Negation 674–675, 677
Manna, Z. 698, 775 See also NOT
Mastermind 169 Neighbor 456
Matrix Nested-loop join 437–439
See Adjacency matrix
Newell, A 335
Maximal clique 525
Nilsson, N. J. 698
Maximal independent set 1–2
Maxterm 660 90-10 rule 92
McCarthy, J. 335 Node 224, 452
McNaughton, R. 589–590 Nonassociative operator
Mead, C. 732 Nondeterministic automaton 539–556
Mealy, G. H. 335 Nonnegative integer
Mean value 212 See Natural number
Membership 338 Nonplanar graph 522–523
Memoing NOR 651–652, 659, 700
See Dynamic programming
NOT 644, 649, 652, 657, 677–679, 700, 740,
Memory 159, 730–731
755–756
Mendelson, E. 698, 775
See also Inverter, Negation
Menon, P. R. 732
Merge 75–79, 136–138, 291 N P (nondeterministic, polynomial-time-
Merge, of connected components 470–475 solvable problems) 672–673
Merge sort 75–84, 136–144 NP-complete problem 672–673
Metasymbol 593 NP-hard problem 673
Micron 711 NULL 22
Microsoft Windows 8 Null character 328
Minimal spanning tree 478–484 Null statement 117
Minimization, of automata 555
Minimum distance 502, 514 O
Minterm 658
Model 769 O
Module See Big-oh
See Abstract data type Occurrence, of an element 290
Modulus operator 19 Odd parity
Modus ponens 688
See Parity bit
Monotone function 659
One-bit adder 10, 656, 707–709
Monte-Carlo algorithm 216–219
Morris, R. 402 One-hot decoder 729
MS-DOS 8 One-one-correspondence 371–372
Multiplexer 723–730 Operating system 8
Multiset 339 Operation 18
INDEX 783

Operator Pivot 514

See Arithmetic operator, Binary oper- Planar graph 522–523
ator, Comparison operator, Complete Plane presentation, of a graph 522
set of operators, Infix operator, Log- Plauger, P. J. 24
ical operator, Nonassociative opera- Pointer 7, 15, 109, 232, 235, 237
tor, Postfix operator, Prefix operator, Poker 184–186
Ternary operator, Unary operator Polynomial time 102
OR 644, 649, 652, 657, 675–679, 688, 700, Pop 306, 308
712–714, 740, 756–757 Postfix expression 243
Ordered tree 227 Postfix operator 64
Ordering 167–169, 178–180, 183
Postorder 241, 492–494
See also Partial order, Postorder, Pre-
POT
order, Total order
See Partially ordered tree
Outcome 188
POT property
Out-degree 462
See Partially ordered tree
Output, circuit 701
Power set 349–350
P Precedence, of operators 561–562, 567, 646,
652, 740–741
P (polynomial-time solvable problems) Predecessor 453, 461
672–673 Predicate 734–736, 745
Palindrome 640 Predicate logic 645, 733–775
Papadimitriou, C. H. 222, 527–528, 698, Prefix 289
775 Prefix expression 243
Parallel execution 699 Prefix operator 63
Parent 224, 237 Prenex form 757–758
Parentheses Preorder 239–241
See Balanced parentheses Primality testing 219
Parity bit 38 Primary index 414–419
Parity function 704 Prime implicant 663
Parse tree 602–610, 630–631 Priority queue 271–279, 506
Parsing 617–634 Probability 187–222
Parsing table 626 Probability space 188
See also Table-driven parser
Probe 306
Partial anagram 542–546
Procedure
Partial function 370
See Function
See also Function
Process 9
Partial order 390
Product 26, 657, 688
Partially ordered tree 272–273, 506–512
See also Cartesian product, Term
Pascal 30
Pascal’s triangle 172, 176 Product of sums 660, 693, 738
Patashnik, O. 155, 221–222 Product rule 200
Path 225, 254, 453, 456, 519, 767 Production 593
Pattern 529–530, 591 Profile 64–65
Patterson, D. A. 732 Profiling 92
Payoff function 212 Program correctness proof 26, 52–59, 84–
Perfect induction 87, 130
See Complete induction Program termination
Perles, M. 641 See Termination
Permutation 160–167 Programming language 6
Peterson, W. W. 402 See also Algol, C, Fortran, IPL-V,
Pigeonhole principle 638 Lisp, Pascal, Prolog, SQL
Pinochle deck 187 Projection 431–432, 436–437, 444–448
Pipe 9 Prolog 5, 733
784 INDEX

Proof 682, 759–770 Reingold, E. M. 402

See also Case analysis, Complete Rejection, of input 533
proof procedure, Contradiction, Con- Relation 366–369, 380–396, 403–411
trapositive, Deduction, Excluded mi- See also Binary relation
ddle, Induction, Program correctness Relation scheme 405
proof, Resolution Relational algebra 428–448
Propagation delay 712 Repeated substitution 134–135, 145–148
Proper subset 347 Replacement 167, 169, 183
Propositional logic 9, 642–698 Resolution 692–697
Propositional variable 643, 734 Restructuring, of hash tables 366
Prototyping 21 Retrieve 292
Push 306, 308 Return
Pushing projections 444–448 See Jump-statement
Pushing selections 442 Return-value 17
Reuse
Q See Software reuse
Right child 253
QED 589 Right sibling 235–238
Quadratic time 97, 103 Ripple-carry addition 11–12, 716
Quantifier Ritchie, D. M. 24
See Existential quantifier, Universal Roberts, E. 24, 88
quantifier Robinson, J. A. 698
Quantifier-free expression 757 Root 224
Query 407 Rooted tree
See also Relational algebra See Unrooted tree
Queue 318–321 Rosenkrantz, D. J. 641
Rule 763
R Running time 27, 89–155, 268–271, 278–
279, 283, 354–356, 365–366, 379, 384–
Rabin, M. O. 221–222, 589–590 385, 476, 482–483, 491, 497, 499, 511–
Random number generator 191 514, 527, 672
Range 368, 414 Run-time organization 312
See also Current domain/range, De- Run-time stack 313
clared domain/range Russell’s paradox 341
Reachable nodes 498–499
See also Warshall’s algorithm S
Read-statement 110
Real number 13, 340, 399–400 Satisfiability problem 673
Rear 318 Scott, D. 589–590
Record Search
See Structure See Binary search, Depth-first search,
Rectified expression Linear search, Ternary search
Recurrence relation 132, 144–154 Secondary index 419–423
Recursion 6, 25, 69–75, 132–136, 239–247, Selection 167–178, 430–431, 437, 441–443
256–257 Selection sort 29–33, 72–73
See also Direct recursion, Divide and Selection statement
conquer, Recursive descent parsing See If-statement
Recursive definition 26–27, 59–69 Sentinel 117, 303
Recursive descent parsing 617–625 Sequential circuit 702
Reduced graph 391 Sequential execution 699
Reflexive-transitive closure 500 Sequential search
Reflexivity 388, 390–391, 674 See Linear search
Regular expression 5, 556–590, 634–639 Set 337–403
Reinforcing events 211–212 See also Infinite set, Probability space
INDEX 785

Set former 339 Strong induction

Sethi, R. 24, 335, 589, 641 See Complete induction
Settled node 502 Stroustrup, B. 24
Shamir, E. 641 Structural induction 248–252, 259, 573
Shannon, C. E. 732 Structure 14, 32, 109, 368, 405
Shortest path Structure tree 118–123
See Dijkstra’s algorithm, Floyd’s al- Structured query language
gorithm See SQL
Sibling 226, 254 Sublist 289
See also Right sibling Subsequence 289
Simple cycle 454, 457 See also Common subsequence, Long-
Simple statement 109–110, 117, 597 est common subsequence
Simplicity 90, 104 Subset 347, 387
Singleton set 350 Subset construction 547–554
Size of arguments 71, 85, 127–128, 132 Substitution, for variables 760–762
Software development 20–22 Substitution of equals for equals 669–670
Software reuse 21 Substitution principle 670–672, 751–752
Sorting 28–33, 163–166, 291, 297 Subsumption 676
See also Heap sort, Merge sort, Selec- Subtree 226
tion sort, Sort-join, Topological sort- Successor 453, 461
ing Suffix 289
Sort-join 438–439 Sum 26, 657, 688
Source node 502 Sum of products 658, 738
Spanning tree Summation rule 105–107
See Depth-first search tree, Minimal Superset 347
spanning tree Surjection 371
Symmetric difference
Sparse graph 461
Symmetry 388–389, 391, 462
Special path 502
Syntactic category 593–594
Splitting lists 79–80, 138–141
Syntax tree
Splitting selections 442
See Expression tree
SQL 435, 733
System R 450
Stack 306–318
Szymanski, T. G. 335
Start state 533, 548
Start symbol 594 T
State 530
See also Accepting state, Dead state, Table 405
Important state, Start state See also Relation
State machine Table-driven parser 625–634
See Automaton Tabulation
Statement See Dynamic programming
See Assignment-statement, Block, Tail, of a list 288
of a program, For-statement, If- See also Cdr
statement, Jump-statement, Read- Tail, of an arc 452–453
statement, Simple statement, While- Tarjan, R. E. 285, 527–528
statement, Write-statement Tautology 669–674, 686–687, 691, 751–759
Static aspects of data model 6 Tautology problem 672
Static variable 17, 313 Term 613
See also Global variable See also Product
Stearns, R. E. 641 Terminal 593–594
Steiglitz, K. 527–528 Termination 57
Stonebraker, M. 450 Ternary operator 64
String Ternary search 306
See Lexicographic order Test suite 22
786 INDEX

Text editor 564 Universal quantifier 739, 750, 755–758, 760

There exists Universal set 341, 345
See Existential quantifier UNIX 8–9, 529–530, 546, 564–567, 589
Thompson, K. 589–590 Unordered tree 478
Tight bound 103–104 See also Ordered tree
Token 564 Unrooted tree 478–479
Tonge, F. M. 335
Top of stack 306 V
Topological sorting 394, 497–498
Total function 370 Variable 735, 753–754
Total order 390–391 See also Bound variable, Free vari-
See also Topological sorting able, Global variable, Local variable,
Transformation 347 Propositional variable, Static variable
Transition 532 Venn diagram 342–343, 346–347, 654
Transitive closure 394, 500
Transitive law 101–102, 387, 390–391, 645,
W
674
Wagner, R. A. 335–336
Traversal
Waldinger, R. 698, 775
See Inorder, Postorder, Preorder
Warshall, S. 527–528
Tree 223–285, 470–475
Warshall’s algorithm 515
See also Binary tree, Depth-first
Weak induction 44
search tree, Expression tree, Full tree,
Weight 478
Minimal spanning tree, Parse tree,
Weinberger, P. J. 450
Partially ordered tree, Structure tree,
While-statement 57, 115, 117, 120–121,
Trie, Unordered tree, Unrooted tree
128, 597
Tree arc 488, 494
Wild card 566
Triangular number 41 Williams, J. W. J. 285
Trie 233–234, 238 Witness 97
TRUE 22 Wong, E. 450
Truncation 328 Worst-case running time 93, 268–269
Truth assignment 647, 745 See also Running time
Truth table 10, 649–655 Write-statement 110
Tuple 366, 404–405
Turing, A. M. 775 Y
Turing machine 772–773
Type descriptor 17 Yamada, H. 589–590
Type system 6, 13–17 Yield, of a tree 603

Ullman, J. D. 155, 335, 450, 527, 589, 641

Ullman, P. M. 542
Unambiguous grammar
See Ambiguous grammar
Unary operator 63
Unary relation 366
Uncountable set
See Countable set
Undecidability 772
Undecidable problem 639
Undirected graph 456–458, 462–463
Union 342, 344, 346, 352–356, 429–430,
436, 441, 558, 569–570, 654
Union type 14