| Record ID | marc_loc_updates/v38.i38.records.utf8:10798711:1006 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_updates/v38.i38.records.utf8:10798711:1006?format=raw |
LEADER: 01006nam a22002777a 4500
001 2010275411
003 DLC
005 20100918083634.0
008 100121s2008 njua b 001 0 eng d
010 $a 2010275411
020 $a9780132288064
020 $a0132288060
035 $a(OCoLC)ocn184990945
040 $aUMC$cUMC$dBAKER$dCUY$dCOD$dDLC
042 $alccopycat
050 00 $aQA267$b.R53 2008
100 1 $aRich, Elaine.
245 10 $aAutomata, computability and complexity :$btheory and applications /$cElaine Rich.
260 $aUpper Saddle River, N.J. :$bPearson Prentice Hall,$cc2008.
300 $axx, 1099 p. :$bill. ;$c25 cm.
504 $aIncludes bibliographical references and index.
505 0 $aFinite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
650 0 $aMachine theory.
650 0 $aComputable functions.
650 0 $aComputational complexity.
650 0 $aElectronic data processing.