000 01373cam a2200349 i 4500
001 16063936
003 EG-ScBUE
005 20250306094549.0
008 100121t2008 njua f b 001 0 eng d
020 _a0132288060
020 _a9780132288064
035 _a(OCoLC)ocn184990945
040 _aUMC
_beng
_erda
_cUMC
_dBAKER
_dCUY
_dCOD
_dDLC
_dEG-ScBUE
082 0 4 _a511.3
_bRIC
_222
100 1 _aRich, Elaine,
_eauthor.
_920453
245 1 0 _aAutomata, computability and complexity :
_btheory and applications /
_cElaine Rich.
264 1 _aUpper Saddle River, N.J. :
_bPearson Prentice Hall,
_c[2008]
264 4 _cc2008
300 _axx, 1099 pages :
_billustrations ;
_c25 cm
336 _2rdacontent
_atext
_btxt
337 _aunmediated
_2rdamedia
_bn
338 _avolume
_bnc
_2rdacarrier
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 7 _aMachine theory.
_2BUEsh
_920454
650 7 _aComputable functions.
_2BUEsh
_920455
650 7 _aComputational complexity.
_2BUEsh
_920456
650 7 _aElectronic data processing.
_2BUEsh
_920457
655 _vReading book
942 _2ddc
_cNB
999 _c14772
_d14772