Grammatical inference : algorithms and applications : 7th international colloquium, ICGI 2004, Athens, Greece, october 11-13, 2004 : proceedings
Gardado en:
| Autor Corporativo: | |
|---|---|
| Outros autores: | , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science. Lecture notes in artificial intelligence
3264 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Grammatical inference, algorithms and applications, 7th international colloquium, ICGI 2004, Athens, Greece, october 11-13, 2004, proceedings, Georgios Paliouras, Yasubumi Sakakibara (eds.), Berlin, Springer, 2004, 1 vol. (XI-289 p.), Lecture notes in computer science, 3-540-23410-1 • Grammatical Inference: Algorithms and Applications, Texte imprimé, 9783662189726 |
| LEADER | 04921nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 970922 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155198688 | ||
| 020 | |a 9783540301950 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 005.131 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a International Colloquium on Grammatical Inference |n (7 |d :2004 |c :Athens, GR). | |
| 245 | 1 | 0 | |a Grammatical inference : |b algorithms and applications : 7th international colloquium, ICGI 2004, Athens, Greece, october 11-13, 2004 : proceedings |c [edited by] Georgios Paliouras, Yasubumi Sakakibara. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science. Lecture notes in artificial intelligence |v 3264 |x 1611-3349 |x 2945-9141 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Papers -- Learning and Mathematics -- Learning Finite-State Models for Machine Translation -- The Omphalos Context-Free Grammar Learning Competition -- Regular Papers -- Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA -- Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptation -- Learning Mild Context-Sensitiveness: Toward Understanding Children s Language Learning -- Learnability of Pregroup Grammars -- A Markovian Approach to the Induction of Regular String Distributions -- Learning Node Selecting Tree Transducer from Completely Annotated Examples -- Identifying Clusters from Positive Data -- Introducing Domain and Typing Bias in Automata Inference -- Analogical Equations in Sequences: Definition and Resolution -- Representing Languages by Learnable Rewriting Systems -- A Divide-and-Conquer Approach to Acquire Syntactic Categories -- Grammatical Inference Using Suffix Trees -- Learning Stochastic Finite Automata -- Navigation Pattern Discovery Using Grammatical Inference -- A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure Grammar -- Partial Learning Using Link Grammars Data -- eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search -- The Boisdale Algorithm An Induction Method for a Subclass of Unification Grammar from Positive Data -- Learning Stochastic Deterministic Regular Languages -- Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data -- Poster Papers -- Learning Syntax from Function Words -- Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages -- Extracting Minimum Length Document Type Definitions Is NP-Hard -- Learning DistinguishableLinear Grammars from Positive Data -- Extending Incremental Learning of Context Free Grammars in Synapse -- Identifying Left-Right Deterministic Linear Languages -- Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples -- An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Langages formels | ||
| 650 | |a Analyse automatique (linguistique) | ||
| 650 | |a Automates mathématiques, Théorie des | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Logique informatique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Paliouras, Georgios, |d 1970- |4 pbd | |
| 700 | 1 | |a Sakakibara, Yasubumi. |4 pbd | |
| 776 | 0 | |0 082030499 |t Grammatical inference |o algorithms and applications |o 7th international colloquium, ICGI 2004, Athens, Greece, october 11-13, 2004 |o proceedings |f Georgios Paliouras, Yasubumi Sakakibara (eds.) |c Berlin |n Springer |d 2004 |p 1 vol. (XI-289 p.) |s Lecture notes in computer science |z 3-540-23410-1 | |
| 776 | 0 | |t Grammatical Inference: Algorithms and Applications |b Texte imprimé |z 9783662189726 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b101520 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-Z9HTPST6-X |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750658169 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b101520 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754007928 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b101520 |z Accès INSA CVL | |
| 997 | |0 970922 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||