| Record ID | ia:introductiontola0000mart |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/introductiontola0000mart/introductiontola0000mart_marc.xml |
| Download MARC binary | https://www.archive.org/download/introductiontola0000mart/introductiontola0000mart_meta.mrc |
LEADER: 03886cam 22007814a 4500
001 ocm49704774
003 OCoLC
005 20210814121920.0
008 020425s2003 maua b 001 0 eng
010 $a 2002070865
040 $aDLC$beng$cDLC$dEYE$dBAKER$dNLGGC$dBTCTA$dLVB$dYDXCP$dIG#$dDEBBG$dOCLCQ$dDEBSZ$dBDX$dOCLCF$dOCLCO$dOCLCQ$dMYMAS$dOCLCQ$dTHHCU$dCNUTO$dVGM$dTHHCU$dOCLCQ$dOCLCO$dUKUOY$dOCLCQ$dNLE$dIL4J6
015 $aGBA3-86466
016 7 $a0071198547.$2Uk
019 $a943428005$a992297239$a1167811603$a1170052637$a1171143900$a1191301758
020 $a0072322004$q(alk. paper)
020 $a9780072322002$q(alk. paper)
020 $a0071198547$q(International ed. ;$qalk. paper)
020 $a9780071198547$q(International ed. ;$qalk. paper)
020 $a0071240187
020 $a9780071240185
035 $a(OCoLC)49704774$z(OCoLC)943428005$z(OCoLC)992297239$z(OCoLC)1167811603$z(OCoLC)1170052637$z(OCoLC)1171143900$z(OCoLC)1191301758
037 $aYPJ$n1 cpy - RM 420.97, 2008 (FIT - Edwin Mit)
042 $apcc
050 00 $aQA267.5.S4$bM29 2003
082 00 $a511.3$221
084 $a54.10$2bcl
084 $aCC 4800$2rvk
084 $aST 130$2rvk
084 $aST 136$2rvk
100 1 $aMartin, John C.
245 10 $aIntroduction to languages and the theory of computation /$cJohn C. Martin.
250 $a3rd ed.
260 $aBoston :$bMcGraw-Hill,$c©2003.
300 $axiii, 543 pages :$billustrations ;$c24 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
504 $aIncludes bibliographical references (pages 529-530) and indexes.
505 0 $aMathematical Notation and Techniques -- Basic Mathematical Objects -- Mathematical Induction and Recursive Definitions -- Regular Languages and Finite Automata -- Regular Languages and Finie Automata -- Nondeterminism and Kleene's Theorem -- Regular and Nonregular Languages -- Context-Free Languages and Pushdown Automata -- Context-Free Grammars -- Pushdown Automata -- Context-Free and Non-Context-Free Languages -- Turing Machines and Their Languages -- Turing Machines -- Recursively Enumerable Languages -- Unsolvable Problems and Computable Functions -- Unsolvable Problems -- Computable Functions -- Introduction to Computational Complexity -- Measuring and Classifying Complexity -- Tractable and Intractable Problems.
650 0 $aSequential machine theory.
650 0 $aComputable functions.
650 6 $aMachines séquentielles, Théorie des.
650 6 $aFonctions calculables.
650 7 $aComputable functions.$2fast$0(OCoLC)fst00871985
650 7 $aSequential machine theory.$2fast$0(OCoLC)fst01112895
650 7 $aAutomatentheorie$2gnd
650 7 $aBerechenbarkeit$2gnd
650 7 $aFormale Sprache$2gnd
650 7 $aTuring-Maschine$2gnd
650 7 $aSequential machine theory.$2nli
650 7 $aComputable functions.$2nli
776 08 $iOnline version:$aMartin, John C.$tIntroduction to languages and the theory of computation.$b3rd ed.$dBoston : McGraw-Hill, ©2003$w(OCoLC)606908837
856 41 $3Table of contents$uhttp://catdir.loc.gov/catdir/toc/mh023/2002070865.html
856 42 $3Publisher description$uhttp://catdir.loc.gov/catdir/description/mh024/2002070865.html
938 $aBaker & Taylor$bBKTY$c177.50$d177.50$i0072322004$n0003988464$sactive
938 $aBrodart$bBROD$n59163089$c$82.50
938 $aBaker and Taylor$bBTCP$n2002070865
938 $aIngram$bINGR$n9780071198547
938 $aYBP Library Services$bYANK$n100312652
029 1 $aAU@$b000023544221
029 1 $aDEBBG$bBV014497780
029 1 $aDEBSZ$b111585864
029 1 $aHEBIS$b107413620
029 1 $aIG#$b9780071198547
029 1 $aNLGGC$b246336692
029 1 $aNZ1$b6899186
994 $aZ0$bP4A
948 $hNO HOLDINGS IN P4A - 175 OTHER HOLDINGS