Index 6 active tape .............................................................. 266 - pruning ............................................................ 787 ACT-V ................................................................... 774 (L) ............................................................... 223, 228 Ada ........................................................................ 668 * 6 adder ...................................................................... 800 adjacency matrix ............................................ 437, 567 0 ….. ................................................................... 589 -automaton .................................................... 83, 144 Adleman, Leonard ......................................... 430, 723 admissibility H ................................. 321, 325, 328, 347, 349, 354 of a heuristic function ............................... 548, 791 H ................................................................ 350, 363 of a search algorithm ......................................... 549 k 426 age of universe ....................................... 419, 433, 799 L 7 agent -loop ......................................................... 54, 60, 136 intelligent .......................... 703, 759, 769, 773, 790 M 333 agreement in natural languages ............. 256, 398, 750 n …............................................................... 541, 571 Aho, Alfred .................................................... 144, 263 P 476 AI See artificial intelligence -recursive function ....................................... 420, 431 AL .......................................................................... 784 -rule ...................................................................... 162 Alexander, Christopher ............................................ 92 15-puzzle ................................................. 32, 544, 551 ALGOL 58............................................................. 664 2-CNF ........................ See 2-conjunctive normal form ALGOL 60..................................................... 152, 664 2-COLORABLE .................................................... 500 Algol 68 ................................................................. 668 2-conjunctive normal form .................................... 498 algorithm.................................................. 27, 301, 592 2FSMs-INTERSECT ............................................. 528 algorithms 2-SAT .................................................... 499, 512, 534 3-conjunctiveBoolean ....................................... 512 2-SAT-MAX .......................................................... 512 3-conjunctiveBoolean ....................................... 607 3-CNF ........................ See 3-conjunctive normal form A* 545 3-COLORABLE .................................................... 500 atmostoneEps .................................................... 163 3-conjunctive normal form ............................ 474, 607 buildFSMcanonicalform ..................................... 69 3-conjunctiveBoolean .................................... 512, 607 buildgrammar ................................................... 197 3-SAT .................................... 474, 485, 487, 499, 607 buildkeywordFSM ............................................. 105 3x+1 problem ................................................. 314, 430 buildunambiggrammar ..................................... 220 4-Color Problem .................................................... 501 cfgtoPDAbottomup ............................................ 192 4-Color Theorem ........................................... 501, 553 cfgtoPDAnoeps ................................................. 231 4-COLORABLE .................................................... 500 cfgtoPDAtopdown ............................................. 191 A ….. ............................................................. 338, 354 CKY ................................................................... 249 A ….. ............................................................ 339, 354 computetransitiveclosure .................................. 582 A* algorithm .................. 545, 550, 553, 675, 759, 790 conjunctiveBoolean ........................................... 607 AALL ............................................................... 339, 354 connected .......................................................... 462 Aanbn ....................................................................... 354 convertPDAtodetnormalform ............................ 639 AANY .............................................................. 339, 354 convertpdatorestricted ...................................... 193 Aaronson, Scott ..................................................... 552 converttoChomsky ............................................. 171 abacus .................................................................... 797 converttoclauseform .......................................... 618 absorption laws .............................................. 557, 579 converttoGreibach ............................................ 632 accepting converttononterminal ........................................ 391 by a deterministic TM ....................................... 274 createOBDDfromtree ........................................ 613 by a DFSM .................................................. 42, 512 decideCFL ......................................................... 230 by a nondeterministic TM ................................. 284 decideCFLempty ............................................... 232 by a PDA........................................... 183, 200, 636 decideCFLinfinite ............................................. 233 by an NDFSM ..................................................... 49 decideCFLusingGrammar ................................ 229 access control matrix ............................................. 718 decideCFLusingPDA ........................................ 231 Ackermann, Wilhelm ............................. 302, 418, 431 decideFSM ........................................................ 136 Ackermann’s function ................................... 418, 431 decideregex ....................................................... 137 818 Index dfsmsimulate ....................................................... 59 alpha-beta pruning ................................................. 787 disjunctiveBoolean ............................................ 608 alt 228 Earleyparse ....................................................... 260 Alternating Bit protocol ............................. 58, 91, 696 emptyFSM ......................................................... 138 alternating Turing machine .................................... 784 emptyFSMcanonicalgraph ................................ 137 ALU ....................................................................... 800 emptyFSMgraph................................................ 137 Amazons ................................................................ 784 emptyFSMsimulate ............................................ 138 ambiguity eps ....................................................................... 53 in context-free grammars159, 245, 246, 367, 373, equalFSMs ........................................................ 140 667 Eulerian ............................................................ 463 in English .................................. 161, 168, 667, 752 finiteFSM .......................................................... 139 in programming languages ................ 160, 166, 668 finiteFSMgraph ................................................. 139 in regular grammars .......................................... 160 finiteFSMsimulate ............................................. 139 inherent ..................................................... 161, 367 first .................................................................... 263 techniques for reducing ..................................... 162 follow ................................................................ 263 ambiguous attachment ........................... 166, 168, 753 forward ............................................................... 80 AnBn ................... 13, 21, 124, 219, 223, 325, 388, 534 fsmtoregex ......................................................... 103 AnBnCn22, 26, 203, 207, 274, 307, 325, 376, 385, 387, fsmtoregexheuristic ............................................. 98 397, 406, 435, 440, 460 game-search ...................................................... 787 and elimination ...................................................... 558 game-search-- .............................................. 788 and introduction ..................................................... 558 grammartofsm ................................................... 114 Anderson, John R. ................................................. 774 infiniteFSM ....................................................... 140 Antikythera Mechanism ................................. xii, 795 intersectPDAandFSM ....................................... 211 antisymmetry ......................................................... 569 Kruskal .............................................................. 465 AP .......................................................................... 784 minDFSM ............................................................ 67 APL ..........................................................................