000 04498nam a22005415i 4500
001 978-3-540-88009-7
003 DE-He213
005 20160624102122.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 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_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.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _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 Computer Science,
_x0302-9743 ;
_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 ?-Tree Languages -- 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 _aComputer science.
650 0 _aLogic design.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aLogics and Meanings of Programs.
700 1 _aClark, Alexander.
_eeditor.
700 1 _aCoste, François.
_eeditor.
700 1 _aMiclet, Laurent.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540880080
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5278
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-88009-7
942 _2EBK8241
_cEBK
999 _c37535
_d37535