Grammatical Inference: Algorithms and Applications: 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $46.48
Usually ships in 1-2 business days
(Save 53%)
Other sellers (Paperback)
  • All (8) from $46.48   
  • New (5) from $61.74   
  • Used (3) from $46.48   


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

Read More Show Less

Product Details

Table of Contents

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

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)