LEADER 01182nam--2200385---450- 001 990003671410203316 005 20120619165222.0 010 $a978-88-04-62099-0 035 $a000367141 035 $aUSA01000367141 035 $a(ALEPH)000367141USA01 035 $a000367141 100 $a20120619d2012----km-y0itay50------ba 101 1 $aita$ceng 102 $aIT 105 $aaf||z|||001yy 200 1 $aJ. Edgar Hoover$ela vita e i segreti del primo capo dell'Fbi$fCurt Gentry$gtraduzione di Marina Astrologo 210 $aMilano$cOscar Mondadori$d2012 215 $a569 p., [16] carte di tav.$cill.$d20 cm 225 2 $aOscar storia$v556 410 0$12001$aOscar storia$v556 454 0$12001$aJ. Edgar Hoover$954250 600 1$aHoover,$bJohn Edgar$2BNCF 676 $a363.25092 700 1$aGENTRY,$bCurt$0522445 702 1$aASTROLOGO,$bMarina 801 0$aIT$bsalbc$gISBD 912 $a990003671410203316 951 $aX.3.B. 6554$b236665 L.M.$cX.3.$d00311863 959 $aBK 969 $aUMA 979 $aANNAMARIA$b90$c20120619$lUSA01$h1649 979 $aANNAMARIA$b90$c20120619$lUSA01$h1652 996 $aJ. Edgar Hoover$954250 997 $aUNISA LEADER 05844nam 22007935 450 001 996465776503316 005 20200704015455.0 010 $a3-540-88009-7 024 7 $a10.1007/978-3-540-88009-7 035 $a(CKB)1000000000490613 035 $a(SSID)ssj0000317973 035 $a(PQKBManifestationID)11231716 035 $a(PQKBTitleCode)TC0000317973 035 $a(PQKBWorkID)10307428 035 $a(PQKB)10447494 035 $a(DE-He213)978-3-540-88009-7 035 $a(MiAaPQ)EBC3063297 035 $a(MiAaPQ)EBC6283101 035 $a(PPN)129063193 035 $a(EXLCZ)991000000000490613 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGrammatical Inference: Algorithms and Applications$b[electronic resource] $e9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings /$fedited by Alexander Clark, François Coste, Laurent Miclet 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XI, 305 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v5278 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-88008-9 320 $aIncludes bibliographical references and index. 327 $aRegular Papers -- Learning Meaning Before Syntax -- Schema-Guided Induction of Monadic Queries -- A Polynomial Algorithm for the Inference of Context Free Languages -- Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings -- Relevant Representations for the Inference of Rational Stochastic Tree Languages -- Learning Commutative Regular Languages -- Learning Left-to-Right and Right-to-Left Iterative Languages -- Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets -- A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness -- On Learning Regular Expressions and Patterns Via Membership and Correction Queries -- State-Merging DFA Induction Algorithms with Mandatory Merge Constraints -- Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries -- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata -- Learning Context-Sensitive Languages from Linear Structural Information -- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries -- How to Split Recursive Automata -- A Note on the Relationship between Different Types of Correction Queries -- Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering -- Polynomial Distinguishability of Timed Automata -- Evaluation and Comparison of Inferred Regular Grammars -- Identification in the Limit of k,l-Substitutable Context-Free Languages -- Poster Papers -- Learning Subclasses of Pure Pattern Languages -- Which Came First, the Grammar or the Lexicon? -- Learning Node Label Controlled Graph Grammars (Extended Abstract) -- Inference of Uniquely Terminating EML -- Estimating Graph Parameters Using Graph Grammars -- Learning of Regular ?-Tree Languages -- Inducing Regular Languages Using Grammar-Based Classifier System -- Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems. 330 $aThis book constitutes the refereed proceedings of the 9th International Colloquium on Grammatical Inference, ICGI 2008, held in Saint-Malo, France, in September 2008. The 21 revised full papers and 8 revised short papers presented were carefully reviewed and selected from 36 submissions. The topics of the papers presented vary from theoretical results of learning algorithms to innovative applications of grammatical inference, and from learning several interesting classes of formal grammars to applications to natural language processing. 410 0$aLecture Notes in Artificial Intelligence ;$v5278 606 $aProgramming languages (Electronic computers) 606 $aArtificial intelligence 606 $aComputer programming 606 $aMathematical logic 606 $aComputer logic 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 615 0$aProgramming languages (Electronic computers). 615 0$aArtificial intelligence. 615 0$aComputer programming. 615 0$aMathematical logic. 615 0$aComputer logic. 615 14$aProgramming Languages, Compilers, Interpreters. 615 24$aArtificial Intelligence. 615 24$aProgramming Techniques. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 676 $a511.3 702 $aClark$b Alexander$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCoste$b François$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMiclet$b Laurent$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Colloquium on Grammatical Inference 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465776503316 996 $aGrammatical Inference: Algorithms and Applications$9772098 997 $aUNISA