Grammatical Inference: Algorithms and Applications: 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings Alex - neues Buch

EAN (ISBN-13): 9783540880080
ISBN (ISBN-10): 3540880089
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2008
Herausgeber: Springer Berlin Heidelberg Core >1 >T
305 Seiten
Gewicht: 0,485 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-12-13T14:43:24+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-04-21T16:33:06+02:00 (Zurich)
ISBN/EAN: 9783540880080

ISBN - alternative Schreibweisen:
3-540-88008-9, 978-3-540-88008-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: laurent, francois, coste, clark lauren, micle, clark herausgeber, held alexander, malo
Titel des Buches: proceedings international, france, grammatical inference algorithms applications, saint, malo, colloquium, grammatica, lecture notes artificial intelligence, gramm mal, clark, september 2008, book alexander, grammatic

---

Daten vom Verlag:

Autor/in: Alexander Clark; François Coste; Laurent Miclet
Titel: Lecture Notes in Artificial Intelligence; Lecture Notes in Computer Science; Grammatical Inference: Algorithms and Applications - 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings
Verlag: Springer; Springer Berlin
305 Seiten
Erscheinungsjahr: 2008-09-11
Berlin; Heidelberg; DE
Sprache: Englisch
74,89 € (DE)
76,99 € (AT)
93,68 CHF (CH)
Contact supplier
XI, 305 p.

BC; Hardcover, Softcover / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Natural; algorithmic learning; algorithms; applications of grammars; biclustering; computational linguistics; context-free grammars; context-free languages; deterministic finite automata; evaluation; finite-state transducers; grammar learning; grammatical inference; learning; Compilers and Interpreters; Artificial Intelligence; Programming Techniques; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Künstliche Intelligenz; Computerprogrammierung und Softwareentwicklung; Theoretische Informatik; EA

Regular 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.