000 | 05025nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-540-88009-7 | ||
003 | DE-He213 | ||
005 | 20240730173618.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540880097 _9978-3-540-88009-7 |
||
024 | 7 |
_a10.1007/978-3-540-88009-7 _2doi |
|
050 | 4 | _aQA76.76.C65 | |
072 | 7 |
_aUMC _2bicssc |
|
072 | 7 |
_aCOM010000 _2bisacsh |
|
072 | 7 |
_aUMC _2thema |
|
082 | 0 | 4 |
_a005.45 _223 |
245 | 1 | 0 |
_aGrammatical Inference: Algorithms and Applications _h[electronic resource] : _b9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings / _cedited by Alexander Clark, François Coste, Laurent Miclet. |
250 | _a1st ed. 2008. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2008. |
|
300 |
_aXI, 305 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v5278 |
|
505 | 0 | _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 ?-TreeLanguages -- Inducing Regular Languages Using Grammar-Based Classifier System -- Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems. | |
520 | _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. | ||
650 | 0 |
_aCompilers (Computer programs). _93350 |
|
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aComputer programming. _94169 |
|
650 | 0 |
_aMachine theory. _9108982 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 1 | 4 |
_aCompilers and Interpreters. _931853 |
650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
650 | 2 | 4 |
_aProgramming Techniques. _9108983 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9108984 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
700 | 1 |
_aClark, Alexander. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9108985 |
|
700 | 1 |
_aCoste, François. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9108986 |
|
700 | 1 |
_aMiclet, Laurent. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9108987 |
|
710 | 2 |
_aSpringerLink (Online service) _9108988 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540880080 |
776 | 0 | 8 |
_iPrinted edition: _z9783540881049 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v5278 _9108989 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-88009-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c89009 _d89009 |