LEADER 01348nam0-22004211i-450-
001 990009426960403321
005 20110920112709.0
010   $a978-88-7192-552-3
035   $a000942696
035   $aFED01000942696
035   $a(Aleph)000942696FED01
035   $a000942696
100   $a20110920d2009----km-y0itaa50------ba
101 1 $aita$ceng
102   $aIT
105   $aa---y---001yy
200 1 $aAutomi, linguaggi e calcolabilitą$fJohn E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman$gedizione italiana a cura di Giovanni Pighizzini
205   $a3. ed.
210   $aMilano$cPearson$dc2009
215   $axix, 499 p.$cill.$d24 cm
300   $atit. orig.: Introduction to automata theory, languages and computation, 3rd ed., Addison Wesley, c2007
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   $a990009426960403321
952   $a511.3-HOP-3$b6919$fSC1
959   $aSC1
996   $aAutomi, linguaggi e calcolabilitą$9723207
997   $aUNINA