| Record ID | harvard_bibliographic_metadata/ab.bib.00.20150123.full.mrc:672361176:1757 |
| Source | harvard_bibliographic_metadata |
| Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.00.20150123.full.mrc:672361176:1757?format=raw |
LEADER: 01757cam a2200361uu 4500
001 000815234-9
005 20020606090541.3
008 781222s1979 maua b 00110 eng
010 $a 78067950 //r82
020 $a020102988X :$c$20.00
035 0 $aocm04549363
040 $aDLC$cDLC$dm.c.
050 0 $aQA267$b.H56
082 $a629.8/312
100 1 $aHopcroft, John E.,$d1939-
245 10 $aIntroduction to automata theory, languages, and computation /$cJohn E. Hopcroft, Jeffrey D. Ullman.
260 0 $aReading, Mass. :$bAddison-Wesley,$cc1979.
300 $ax, 418 p. :$bill. ;$c25 cm.
490 0 $aAddison-Wesley series in computer science
500 $aIncludes index.
504 $aBibliography: p. 396-410.
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.
650 0 $aMachine theory.
650 0 $aFormal languages.
650 0 $aComputational complexity.
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-$ejoint author.
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
988 $a20020608
906 $0DLC