rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Grammatical Inference: Algorithms and Applications
    sub title: 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings
  name:
    name part: Oliveira, Arlindo L.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2000
    edition: 1st ed. 2000.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: VIII, 316 p. online resource.
  table of contents: Inference of Finite-State Transducers by Using Regular Grammars and Morphisms -- Computational Complexity of Problems on Probabilistic Grammars and Transducers -- Efficient Ambiguity Detection in C-NFA -- Learning Regular Languages Using Non Deterministic Finite Automata -- Smoothing Probabilistic Automata: An Error-Correcting Approach -- Inferring Subclasses of Contextual Languages -- Permutations and Control Sets for Learning Non-regular Language Families -- On the Complexity of Consistent Identification of Some Classes of Structure Languages -- Computation of Substring Probabilities in Stochastic Grammars -- A Comparative Study of Two Algorithms for Automata Identification -- The Induction of Temporal Grammatical Rules from Multivariate Time Series -- Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata -- Iterated Transductions and Efficient Learning from Positive Data: A Unifying View -- An Inverse Limit of Context-Free Grammars - A New Approach to Identifiability in the Limit -- Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm -- Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Context-Free Grammars -- On the Relationship between Models for Learning in Helpful Environments -- Probabilistic k-Testable Tree Languages -- Learning Context-Free Grammars from Partially Structured Examples -- Identification of Tree Translation Rules from Examples -- Counting Extensional Differences in BC-Learning -- Constructive Learning of Context-Free Languages with a Subpansive Tree -- A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample -- Improve the Learning of Subsequential Transducers by Using Alignments and Dictionaries.
  note: edited by Arlindo L. Oliveira.
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Pattern recognition
  subject:
    topic: Artificial intelligence
  subject:
    topic: Mathematical logic
  subject:
    topic: Algorithms
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Pattern Recognition
  subject:
    topic: Artificial Intelligence
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Algorithm Analysis and Problem Complexity
  classification: QA76.7-76.73
  classification: QA76.76.C65
  classification: 005.13
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Artificial Intelligence ; 1891
  identifier: 9783540452577
  identifier: https://doi.org/10.1007/b75249
  record info:
    record creation date: 121227
    record change date: 20191024052546.0
    record identifier: 978-3-540-45257-7