| Record ID | ia:trent_0116301269779 |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/trent_0116301269779/trent_0116301269779_marc.xml |
| Download MARC binary | https://www.archive.org/download/trent_0116301269779/trent_0116301269779_meta.mrc |
LEADER: 02973cam 2200661 i 4500
001 ocm04549363
003 OCoLC
005 20191227154801.0
008 781222s1979 maua b 001 0 eng
010 $a 78067950
040 $aDLC$beng$cDLC$dFIL$dMUQ$dNLGGC$dOCLCG$dYDXCP$dAU@$dZWZ$dOCLCQ$dMCW$dGBVCP$dOCLCF$dOCLCQ$dOCLCO$dOCLCQ$dIPL$dOCLCQ$dBGU$dUKBTH$dOCLCQ
020 $a020102988X
020 $a9780201029888
035 $a(OCoLC)4549363
050 00 $aQA267$b.H56
080 0 $a518.3
082 04 $a629.8/312
084 $a54.10$2bcl
100 1 $aHopcroft, John E.,$d1939-
245 10 $aIntroduction to automata theory, languages, and computation /$cJohn E. Hopcroft, Jeffrey D. Ullman.
260 $aReading, Mass. :$bAddison-Wesley,$c©1979.
300 $ax, 418 pages :$billustrations ;$c24 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
490 1 $aAddison-Wesley series in computer science
504 $aIncludes bibliographical references (pages 396-410) and index.
505 0 $aPreliminaries -- Finite automata and regular expressions -- Properties of regular sets -- Context-free grammars -- Pushdown automata -- Properties of context-free languages -- Turing machines -- Undecidability -- The Chomsky hierarchy -- Deterministic context-free languages -- Closure properties of families of languages -- Computational complexity theory -- Intractable problems -- Highlights of other important language classes.
530 $aAlso issued online.
650 0 $aMachine theory.
650 0 $aFormal languages.
650 0 $aComputational complexity.
650 6 $aAutomates mathématiques, Théorie des.
650 6 $aLangages formels.
650 6 $aComplexité de calcul (Informatique)
650 7 $aComputational complexity.$2fast$0(OCoLC)fst00871991
650 7 $aFormal languages.$2fast$0(OCoLC)fst00932922
650 7 $aMachine theory.$2fast$0(OCoLC)fst01004846
650 17 $aFormele talen.$2gtt
650 17 $aProgrammeren (computers)$2gtt
650 17 $aComputers.$2gtt
650 7 $aAutomates mathématiques, théorie des.$2ram
650 7 $aLangages formels.$2ram
650 7 $aComplexité de calcul (informatique)$2ram
700 1 $aUllman, Jeffrey D.,$d1942-$eauthor.
776 08 $iOnline version:$aHopcroft, John E., 1939-$tIntroduction to automata theory, languages, and computation.$dReading, Mass. : Addison-Wesley, ©1979$w(OCoLC)643768674
830 0 $aAddison-Wesley series in computer science.
856 41 $3Table of contents$uhttp://www.gbv.de/dms/hebis-mainz/toc/02558085X.pdf
938 $aYBP Library Services$bYANK$n119301
029 1 $aAU@$b000001339113
029 1 $aAU@$b000023871315
029 1 $aDEBSZ$b008647453
029 1 $aGBVCP$b024951714
029 1 $aHR0$b020102988x
029 1 $aNZ1$b2711756
029 1 $aUNITY$b018929095
994 $aZ0$bP4A
948 $hNO HOLDINGS IN P4A - 805 OTHER HOLDINGS