String Extension Learning Using Lattices
Identifieur interne : 001A74 ( Istex/Corpus ); précédent : 001A73; suivant : 001A75String Extension Learning Using Lattices
Auteurs : Anna Kasprzik ; Timo KötzingSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Abstract
Abstract: The class of regular languages is not identifiable from positive data in Gold’s language learning model. Many attempts have been made to define interesting classes that are learnable in this model, preferably with the associated learner having certain advantageous properties. Heinz ’09 presents a set of language classes called String Extension (Learning) Classes, and shows it to have several desirable properties. In the present paper, we extend the notion of String Extension Classes by basing it on lattices and formally establish further useful properties resulting from this extension. Using lattices enables us to cover a larger range of language classes including the pattern languages, as well as to give various ways of characterizing String Extension Classes and its learners. We believe this paper to show that String Extension Classes are learnable in a very natural way, and thus worthy of further study.
Url:
DOI: 10.1007/978-3-642-13089-2_32
Links to Exploration step
ISTEX:8D3D63AB10FB4EED809EDDAFA7309D64192C12A0Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">String Extension Learning Using Lattices</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name><affiliation><mods:affiliation>FB IV – Abteilung Informatik, Universität Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kasprzik@informatik.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Kotzing, Timo" sort="Kotzing, Timo" uniqKey="Kotzing T" first="Timo" last="Kötzing">Timo Kötzing</name><affiliation><mods:affiliation>Department 1: Algorithms and Complexity, Max-Planck-Institut für Informatik, 66123, Saarbrücken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: koetzing@mpi-inf.mpg.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8D3D63AB10FB4EED809EDDAFA7309D64192C12A0</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-13089-2_32</idno><idno type="url">https://api.istex.fr/document/8D3D63AB10FB4EED809EDDAFA7309D64192C12A0/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001A74</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A74</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">String Extension Learning Using Lattices</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name><affiliation><mods:affiliation>FB IV – Abteilung Informatik, Universität Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kasprzik@informatik.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Kotzing, Timo" sort="Kotzing, Timo" uniqKey="Kotzing T" first="Timo" last="Kötzing">Timo Kötzing</name><affiliation><mods:affiliation>Department 1: Algorithms and Complexity, Max-Planck-Institut für Informatik, 66123, Saarbrücken, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: koetzing@mpi-inf.mpg.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2010</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">8D3D63AB10FB4EED809EDDAFA7309D64192C12A0</idno><idno type="DOI">10.1007/978-3-642-13089-2_32</idno><idno type="ChapterID">32</idno><idno type="ChapterID">Chap32</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The class of regular languages is not identifiable from positive data in Gold’s language learning model. Many attempts have been made to define interesting classes that are learnable in this model, preferably with the associated learner having certain advantageous properties. Heinz ’09 presents a set of language classes called String Extension (Learning) Classes, and shows it to have several desirable properties. In the present paper, we extend the notion of String Extension Classes by basing it on lattices and formally establish further useful properties resulting from this extension. Using lattices enables us to cover a larger range of language classes including the pattern languages, as well as to give various ways of characterizing String Extension Classes and its learners. We believe this paper to show that String Extension Classes are learnable in a very natural way, and thus worthy of further study.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Anna Kasprzik</name><affiliations><json:string>FB IV – Abteilung Informatik, Universität Trier, 54286, Trier, Germany</json:string><json:string>E-mail: kasprzik@informatik.uni-trier.de</json:string></affiliations></json:item><json:item><name>Timo Kötzing</name><affiliations><json:string>Department 1: Algorithms and Complexity, Max-Planck-Institut für Informatik, 66123, Saarbrücken, Germany</json:string><json:string>E-mail: koetzing@mpi-inf.mpg.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: The class of regular languages is not identifiable from positive data in Gold’s language learning model. Many attempts have been made to define interesting classes that are learnable in this model, preferably with the associated learner having certain advantageous properties. Heinz ’09 presents a set of language classes called String Extension (Learning) Classes, and shows it to have several desirable properties. In the present paper, we extend the notion of String Extension Classes by basing it on lattices and formally establish further useful properties resulting from this extension. Using lattices enables us to cover a larger range of language classes including the pattern languages, as well as to give various ways of characterizing String Extension Classes and its learners. We believe this paper to show that String Extension Classes are learnable in a very natural way, and thus worthy of further study.</abstract><qualityIndicators><score>8.216</score><pdfVersion>1.6</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>929</abstractCharCount><pdfWordCount>5575</pdfWordCount><pdfCharCount>25445</pdfCharCount><pdfPageCount>12</pdfPageCount><abstractWordCount>143</abstractWordCount></qualityIndicators><title>String Extension Learning Using Lattices</title><chapterId><json:string>32</json:string><json:string>Chap32</json:string></chapterId><refBibs><json:item><author><json:item><name>D Angluin</name></json:item></author><host><volume>45</volume><pages><last>135</last><first>117</first></pages><author></author><title>Information and Control</title><publicationDate>1980</publicationDate></host><title>Inductive inference of formal languages from positive data</title><publicationDate>1980</publicationDate></json:item><json:item><author><json:item><name>D Angluin</name></json:item></author><host><volume>75</volume><pages><last>106</last><first>87</first></pages><author></author><title>Information and Computation</title><publicationDate>1987</publicationDate></host><title>Learning regular sets from queries and counterexamples</title><publicationDate>1987</publicationDate></json:item><json:item><author><json:item><name>B¯ Arzdi¸arzdi¸nš</name></json:item><json:item><name>J </name></json:item></author><host><pages><last>560</last><first>455</first></pages><author></author><title>Proceedings of the 20th International Congress of Mathematicians</title><publicationDate>1974</publicationDate></host><title>Inductive inference of automata, functions and programs</title><publicationDate>1974</publicationDate></json:item><json:item><host><author><json:item><name>G Birkhoff</name></json:item></author><title>Lattice Theory</title><publicationDate>1984</publicationDate></host></json:item><json:item><author><json:item><name>L Blum</name></json:item><json:item><name>M Blum</name></json:item></author><host><volume>28</volume><pages><last>155</last><first>125</first></pages><author></author><title>Information and Control</title><publicationDate>1975</publicationDate></host><title>Toward a mathematical theory of inductive inference</title><publicationDate>1975</publicationDate></json:item><json:item><author><json:item><name>J Case</name></json:item><json:item><name>S Jain</name></json:item><json:item><name>S Lange</name></json:item><json:item><name>T Zeugmann</name></json:item></author><host><volume>152</volume><pages><last>110</last><first>74</first></pages><author></author><title>Information and Computation</title><publicationDate>1999</publicationDate></host><title>Incremental concept learning for bounded data mining</title><publicationDate>1999</publicationDate></json:item><json:item><author><json:item><name>M De Brecht</name></json:item><json:item><name>M Kobayashi</name></json:item><json:item><name>H Tokunaga</name></json:item><json:item><name>A Yamamoto</name></json:item></author><host><pages><last>275</last><first>265</first></pages><author></author><title>JSAI 2006</title><publicationDate>2007</publicationDate></host><title>Inferability of closed set systems from positive data</title><publicationDate>2007</publicationDate></json:item><json:item><host><author><json:item><name>C De La Higuera</name></json:item></author><title>Grammatical Inference</title><publicationDate>2010</publicationDate></host></json:item><json:item><author><json:item><name>H Fernau</name></json:item></author><host><volume>290</volume><issue>3</issue><author></author><title>Theoretical Computer Science</title><publicationDate>2003</publicationDate></host><title>Identification of function distinguishable languages</title><publicationDate>2003</publicationDate></json:item><json:item><host><author><json:item><name>M Fulk</name></json:item></author><title>A Study of Inductive Inference Machines</title><publicationDate>1985</publicationDate></host></json:item><json:item><author><json:item><name>E Gold</name></json:item></author><host><volume>10</volume><pages><last>474</last><first>447</first></pages><author></author><title>Information and Control</title><publicationDate>1967</publicationDate></host><title>Language identification in the limit</title><publicationDate>1967</publicationDate></json:item><json:item><host><author><json:item><name>J Heinz</name></json:item></author><title>String extension learning</title><publicationDate>2009</publicationDate></host></json:item><json:item><host><author><json:item><name>S Jain</name></json:item><json:item><name>D Osherson</name></json:item><json:item><name>J Royer</name></json:item><json:item><name>A Sharma</name></json:item></author><title>Systems that Learn: An Introduction to Learning Theory</title><publicationDate>1999</publicationDate></host></json:item><json:item><author><json:item><name>K,P Jantke</name></json:item></author><host><volume>8</volume><issue>4</issue><author></author><title>New Generation Computing</title><publicationDate>1991</publicationDate></host><title>Monotonic and non-monotonic inductive inference</title><publicationDate>1991</publicationDate></json:item><json:item><author><json:item><name>S Lange</name></json:item><json:item><name>R Wiehagen</name></json:item></author><host><volume>8</volume><pages><last>370</last><first>361</first></pages><author></author><title>New Generation Computing</title><publicationDate>1991</publicationDate></host><title>Polynomial time inference of arbitrary pattern languages</title><publicationDate>1991</publicationDate></json:item><json:item><author><json:item><name>J Nation</name></json:item></author><host><author></author><title>Notes on lattice theory</title><publicationDate>2009</publicationDate></host><publicationDate>2009</publicationDate></json:item><json:item><host><author><json:item><name>D Osherson</name></json:item><json:item><name>M Stob</name></json:item><json:item><name>S Weinstein</name></json:item></author><title>Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists</title><publicationDate>1986</publicationDate></host></json:item><json:item><host><author><json:item><name>H Rogers</name></json:item></author><title>Theory of Recursive Functions and Effective Computability</title><publicationDate>1967</publicationDate></host></json:item><json:item><author><json:item><name>J Royer</name></json:item><json:item><name>J Case</name></json:item></author><host><author></author><title>Research monograph in Progress in Theoretical Computer Science</title><publicationDate>1994</publicationDate></host><title>Subrecursive Programming Systems: Complexity and Succinctness</title><publicationDate>1994</publicationDate></json:item><json:item><host><author><json:item><name>S Weinstein</name></json:item></author><title>Private communication at the Workshop on Learnability Theory and Linguistics</title><publicationDate>1982</publicationDate></host></json:item><json:item><host><author><json:item><name>K Wexler</name></json:item><json:item><name>P Culicover</name></json:item></author><title>Formal Principles of Language Acquisition</title><publicationDate>1980</publicationDate></host></json:item><json:item><author><json:item><name>R Wiehagen</name></json:item></author><host><volume>12</volume><pages><last>99</last><first>93</first></pages><author></author><title>Elektronische Informationsverarbeitung und Kybernetik</title><publicationDate>1976</publicationDate></host><title>Limes-Erkennung rekursiver Funktionen durch spezielle Strategien</title><publicationDate>1976</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2010</copyrightDate></serie><host><editor><json:item><name>Adrian-Horia Dediu</name><affiliations><json:string>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</json:string><json:string>E-mail: adrian.dediu@urv.cat</json:string></affiliations></json:item><json:item><name>Henning Fernau</name><affiliations><json:string>Fachbereich IV - Informatik, Universität Trier, Campus II, Behringstraße, 54286, Trier, Germany</json:string><json:string>E-mail: fernau@informatik.uni-trier.de</json:string></affiliations></json:item><json:item><name>Carlos Martín-Vide</name><affiliations><json:string>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</json:string><json:string>E-mail: cmv@astor.urv.es</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Pattern Recognition</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item></subject><isbn><json:string>978-3-642-13088-5</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Language and Automata Theory and Applications</title><bookId><json:string>978-3-642-13089-2</json:string></bookId><volume>6031</volume><pages><last>391</last><first>380</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-13089-2</json:string></eisbn><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-13089-2</json:string></doi></host><publicationDate>2010</publicationDate><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-13089-2_32</json:string></doi><id>8D3D63AB10FB4EED809EDDAFA7309D64192C12A0</id><score>0.39468294</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/8D3D63AB10FB4EED809EDDAFA7309D64192C12A0/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/8D3D63AB10FB4EED809EDDAFA7309D64192C12A0/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/8D3D63AB10FB4EED809EDDAFA7309D64192C12A0/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">String Extension Learning Using Lattices</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2010</p></availability><date>2010</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">String Extension Learning Using Lattices</title><author xml:id="author-1"><persName><forename type="first">Anna</forename><surname>Kasprzik</surname></persName><email>kasprzik@informatik.uni-trier.de</email><affiliation>FB IV – Abteilung Informatik, Universität Trier, 54286, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Timo</forename><surname>Kötzing</surname></persName><email>koetzing@mpi-inf.mpg.de</email><affiliation>Department 1: Algorithms and Complexity, Max-Planck-Institut für Informatik, 66123, Saarbrücken, Germany</affiliation></author></analytic><monogr><title level="m">Language and Automata Theory and Applications</title><title level="m" type="sub">4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings</title><idno type="pISBN">978-3-642-13088-5</idno><idno type="eISBN">978-3-642-13089-2</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-13089-2</idno><idno type="book-ID">978-3-642-13089-2</idno><idno type="book-title-ID">211346</idno><idno type="book-sequence-number">6031</idno><idno type="book-volume-number">6031</idno><idno type="book-chapter-count">51</idno><editor><persName><forename type="first">Adrian-Horia</forename><surname>Dediu</surname></persName><email>adrian.dediu@urv.cat</email><affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</affiliation></editor><editor><persName><forename type="first">Henning</forename><surname>Fernau</surname></persName><email>fernau@informatik.uni-trier.de</email><affiliation>Fachbereich IV - Informatik, Universität Trier, Campus II, Behringstraße, 54286, Trier, Germany</affiliation></editor><editor><persName><forename type="first">Carlos</forename><surname>Martín-Vide</surname></persName><email>cmv@astor.urv.es</email><affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2010"></date><biblScope unit="volume">6031</biblScope><biblScope unit="page" from="380">380</biblScope><biblScope unit="page" to="391">391</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2010</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">8D3D63AB10FB4EED809EDDAFA7309D64192C12A0</idno><idno type="DOI">10.1007/978-3-642-13089-2_32</idno><idno type="ChapterID">32</idno><idno type="ChapterID">Chap32</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2010</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The class of regular languages is not identifiable from positive data in Gold’s language learning model. Many attempts have been made to define interesting classes that are learnable in this model, preferably with the associated learner having certain advantageous properties. Heinz ’09 presents a set of language classes called String Extension (Learning) Classes, and shows it to have several desirable properties. In the present paper, we extend the notion of String Extension Classes by basing it on lattices and formally establish further useful properties resulting from this extension. Using lattices enables us to cover a larger range of language classes including the pattern languages, as well as to give various ways of characterizing String Extension Classes and its learners. We believe this paper to show that String Extension Classes are learnable in a very natural way, and thus worthy of further study.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16013</label><label>I16021</label><label>I21017</label><label>I16048</label><label>I2203X</label><label>I1603X</label><item><term>Computer Science</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Pattern Recognition</term></item><item><term>Logics and Meanings of Programs</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2010">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/8D3D63AB10FB4EED809EDDAFA7309D64192C12A0/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-13089-2</BookID><BookTitle>Language and Automata Theory and Applications</BookTitle><BookSubTitle>4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings</BookSubTitle><BookVolumeNumber>6031</BookVolumeNumber><BookSequenceNumber>6031</BookSequenceNumber><BookDOI>10.1007/978-3-642-13089-2</BookDOI><BookTitleID>211346</BookTitleID><BookPrintISBN>978-3-642-13088-5</BookPrintISBN><BookElectronicISBN>978-3-642-13089-2</BookElectronicISBN><BookChapterCount>51</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I16021" Priority="2" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I21017" Priority="3" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I16048" Priority="4" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I2203X" Priority="5" Type="Secondary">Pattern Recognition</BookSubject><BookSubject Code="I1603X" Priority="6" Type="Secondary">Logics and Meanings of Programs</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Adrian-Horia</GivenName><FamilyName>Dediu</FamilyName></EditorName><Contact><Email>adrian.dediu@urv.cat</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Henning</GivenName><FamilyName>Fernau</FamilyName></EditorName><Contact><Email>fernau@informatik.uni-trier.de</Email></Contact></Editor><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Carlos</GivenName><FamilyName>Martín-Vide</FamilyName></EditorName><Contact><Email>cmv@astor.urv.es</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Research Group on Mathematical Linguistics</OrgDivision><OrgName>Universitat Rovira i Virgili</OrgName><OrgAddress><Street>Avinguda Catalunya, 35</Street><Postcode>43002</Postcode><City>Tarragona</City><Country>Spain</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgDivision>Fachbereich IV - Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Street>Campus II, Behringstraße</Street><Postcode>54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID><PartSequenceNumber>2</PartSequenceNumber><PartTitle>Regular Papers</PartTitle><PartChapterCount>47</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Language and Automata Theory and Applications</BookTitle></PartContext></PartInfo><Chapter ID="Chap32" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>32</ChapterID><ChapterDOI>10.1007/978-3-642-13089-2_32</ChapterDOI><ChapterSequenceNumber>32</ChapterSequenceNumber><ChapterTitle Language="En">String Extension Learning Using Lattices</ChapterTitle><ChapterFirstPage>380</ChapterFirstPage><ChapterLastPage>391</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>2</PartID><BookID>978-3-642-13089-2</BookID><BookTitle>Language and Automata Theory and Applications</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Anna</GivenName><FamilyName>Kasprzik</FamilyName></AuthorName><Contact><Email>kasprzik@informatik.uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Timo</GivenName><FamilyName>Kötzing</FamilyName></AuthorName><Contact><Email>koetzing@mpi-inf.mpg.de</Email></Contact></Author><Affiliation ID="Aff18"><OrgDivision>FB IV – Abteilung Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Postcode>54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgDivision>Department 1: Algorithms and Complexity</OrgDivision><OrgName>Max-Planck-Institut für Informatik</OrgName><OrgAddress><Postcode>66123</Postcode><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The class of regular languages is not identifiable from positive data in Gold’s language learning model. Many attempts have been made to define interesting classes that are learnable in this model, preferably with the associated learner having certain advantageous properties. Heinz ’09 presents a set of language classes called <Emphasis Type="Italic">String Extension (Learning) Classes</Emphasis>, and shows it to have several desirable properties.</Para><Para>In the present paper, we extend the notion of String Extension Classes by basing it on <Emphasis Type="Italic">lattices</Emphasis> and formally establish further useful properties resulting from this extension. Using lattices enables us to cover a larger range of language classes including the <Emphasis Type="Italic">pattern languages</Emphasis>, as well as to give various ways of <Emphasis Type="Italic">characterizing</Emphasis> String Extension Classes and its learners. We believe this paper to show that String Extension Classes are learnable in a <Emphasis Type="Italic">very natural way</Emphasis>, and thus worthy of further study.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>String Extension Learning Using Lattices</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>String Extension Learning Using Lattices</title></titleInfo><name type="personal"><namePart type="given">Anna</namePart><namePart type="family">Kasprzik</namePart><affiliation>FB IV – Abteilung Informatik, Universität Trier, 54286, Trier, Germany</affiliation><affiliation>E-mail: kasprzik@informatik.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Timo</namePart><namePart type="family">Kötzing</namePart><affiliation>Department 1: Algorithms and Complexity, Max-Planck-Institut für Informatik, 66123, Saarbrücken, Germany</affiliation><affiliation>E-mail: koetzing@mpi-inf.mpg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2010</dateIssued><copyrightDate encoding="w3cdtf">2010</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The class of regular languages is not identifiable from positive data in Gold’s language learning model. Many attempts have been made to define interesting classes that are learnable in this model, preferably with the associated learner having certain advantageous properties. Heinz ’09 presents a set of language classes called String Extension (Learning) Classes, and shows it to have several desirable properties. In the present paper, we extend the notion of String Extension Classes by basing it on lattices and formally establish further useful properties resulting from this extension. Using lattices enables us to cover a larger range of language classes including the pattern languages, as well as to give various ways of characterizing String Extension Classes and its learners. We believe this paper to show that String Extension Classes are learnable in a very natural way, and thus worthy of further study.</abstract><relatedItem type="host"><titleInfo><title>Language and Automata Theory and Applications</title><subTitle>4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Adrian-Horia</namePart><namePart type="family">Dediu</namePart><affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</affiliation><affiliation>E-mail: adrian.dediu@urv.cat</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Henning</namePart><namePart type="family">Fernau</namePart><affiliation>Fachbereich IV - Informatik, Universität Trier, Campus II, Behringstraße, 54286, Trier, Germany</affiliation><affiliation>E-mail: fernau@informatik.uni-trier.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Carlos</namePart><namePart type="family">Martín-Vide</namePart><affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</affiliation><affiliation>E-mail: cmv@astor.urv.es</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I2203X">Pattern Recognition</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic></subject><identifier type="DOI">10.1007/978-3-642-13089-2</identifier><identifier type="ISBN">978-3-642-13088-5</identifier><identifier type="eISBN">978-3-642-13089-2</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">211346</identifier><identifier type="BookID">978-3-642-13089-2</identifier><identifier type="BookChapterCount">51</identifier><identifier type="BookVolumeNumber">6031</identifier><identifier type="BookSequenceNumber">6031</identifier><identifier type="PartChapterCount">47</identifier><part><date>2010</date><detail type="part"><title>Regular Papers</title></detail><detail type="volume"><number>6031</number><caption>vol.</caption></detail><extent unit="pages"><start>380</start><end>391</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><identifier type="istex">8D3D63AB10FB4EED809EDDAFA7309D64192C12A0</identifier><identifier type="DOI">10.1007/978-3-642-13089-2_32</identifier><identifier type="ChapterID">32</identifier><identifier type="ChapterID">Chap32</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2010</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001A74 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001A74 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:8D3D63AB10FB4EED809EDDAFA7309D64192C12A0
|texte= String Extension Learning Using Lattices
}}
| This area was generated with Dilib version V0.6.31. |  |