LEADER 01273nam0-22004091i-450-
001 990008357160403321
005 20110504151105.0
010   $a88-7192-154-2
035   $a000835716
035   $aFED01000835716
035   $a(Aleph)000835716FED01
035   $a000835716
100   $a20060704d2003----km-y0itay50------ba
101 1 $aita$ceng
102   $aIT
105   $aa---a---001yy
200 1 $aAutomi, linguaggi e calcolabilitą$fJohn E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman
210   $aMilano$cPearson$dc2003
215   $axvii, 548 p.$cill.$d24 cm
300   $atit. orig.: Introduction to automata theory, languages and computation, 2nd ed., Addison Wesley, c2001
610 0 $aTeoria delle macchine
610 0 $aLinguaggi formali
610 0 $aTeorema di completezza
610 0 $aStati finiti
610 0 $aLinguaggi regolari
610 0 $aMacchine di Turing
676   $a511.3$v21
700  1$aHopcroft,$bJohn E.$044212
701  1$aMotwani,$bRajeev$065488
701  1$aUllman,$bJeffrey D.$f<1942- >$09704
801  0$aIT$bUNINA$gRICA$2UNIMARC
901   $aBK
912   $a990008357160403321
952   $a511.3-HOP-2$b4333$fSC1
959   $aSC1
996   $aAutomi, linguaggi e calcolabilitą$9723207
997   $aUNINA