Serveur d'exploration sur l'Université de Trèves

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data

Identifieur interne : 000796 ( Istex/Corpus ); précédent : 000795; suivant : 000797

Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data

Auteurs : Anna Kasprzik

Source :

RBID : ISTEX:7EFE870F192FCB69B9275D35FC606D01680A819E

Abstract

Abstract: The area of Grammatical Inference centers on learning algorithms: Algorithms that infer a description (e.g., a grammar or an automaton) for an unknown formal language from given information in finitely many steps. Various conceivable learning settings have been outlined, and based on those a range of algorithms have been developed. One of the language classes studied most extensively with respect to its algorithmical learnability is the class of regular string languages.

Url:
DOI: 10.1007/978-3-642-22321-1_45

Links to Exploration step

ISTEX:7EFE870F192FCB69B9275D35FC606D01680A819E

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</title>
<author>
<name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name>
<affiliation>
<mods:affiliation>FB IV (Theoretical Computer Science), University of Trier, Germany</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>E-mail: kasprzik@informatik.uni-trier.de</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:7EFE870F192FCB69B9275D35FC606D01680A819E</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-22321-1_45</idno>
<idno type="url">https://api.istex.fr/document/7EFE870F192FCB69B9275D35FC606D01680A819E/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000796</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000796</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</title>
<author>
<name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name>
<affiliation>
<mods:affiliation>FB IV (Theoretical Computer Science), University of Trier, Germany</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>E-mail: kasprzik@informatik.uni-trier.de</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<imprint>
<date>2011</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">7EFE870F192FCB69B9275D35FC606D01680A819E</idno>
<idno type="DOI">10.1007/978-3-642-22321-1_45</idno>
<idno type="ChapterID">45</idno>
<idno type="ChapterID">Chap45</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 area of Grammatical Inference centers on learning algorithms: Algorithms that infer a description (e.g., a grammar or an automaton) for an unknown formal language from given information in finitely many steps. Various conceivable learning settings have been outlined, and based on those a range of algorithms have been developed. One of the language classes studied most extensively with respect to its algorithmical learnability is the class of regular string languages.</div>
</front>
</TEI>
<istex>
<corpusName>springer</corpusName>
<author>
<json:item>
<name>Anna Kasprzik</name>
<affiliations>
<json:string>FB IV (Theoretical Computer Science), University of Trier, Germany</json:string>
<json:string>E-mail: kasprzik@informatik.uni-trier.de</json:string>
</affiliations>
</json:item>
</author>
<language>
<json:string>eng</json:string>
</language>
<originalGenre>
<json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: The area of Grammatical Inference centers on learning algorithms: Algorithms that infer a description (e.g., a grammar or an automaton) for an unknown formal language from given information in finitely many steps. Various conceivable learning settings have been outlined, and based on those a range of algorithms have been developed. One of the language classes studied most extensively with respect to its algorithmical learnability is the class of regular string languages.</abstract>
<qualityIndicators>
<score>3.248</score>
<pdfVersion>1.6</pdfVersion>
<pdfPageSize>429.442 x 659.895 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<keywordCount>0</keywordCount>
<abstractCharCount>485</abstractCharCount>
<pdfWordCount>884</pdfWordCount>
<pdfCharCount>5134</pdfCharCount>
<pdfPageCount>2</pdfPageCount>
<abstractWordCount>72</abstractWordCount>
</qualityIndicators>
<title>Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</title>
<chapterId>
<json:string>45</json:string>
<json:string>Chap45</json:string>
</chapterId>
<refBibs>
<json:item>
<author>
<json:item>
<name>D Angluin</name>
</json:item>
</author>
<host>
<volume>75</volume>
<pages>
<last>106</last>
<first>87</first>
</pages>
<issue>2</issue>
<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>F Denis</name>
</json:item>
<json:item>
<name>A Lemay</name>
</json:item>
<json:item>
<name>A Terlutte</name>
</json:item>
</author>
<host>
<volume>51</volume>
<pages>
<last>368</last>
<first>339</first>
</pages>
<author></author>
<title>Fundamentae Informaticae</title>
<publicationDate>2002</publicationDate>
</host>
<title>Residual finite state automata</title>
<publicationDate>2002</publicationDate>
</json:item>
<json:item>
<author>
<json:item>
<name>D Angluin</name>
</json:item>
</author>
<host>
<volume>51</volume>
<pages>
<last>87</last>
<first>76</first>
</pages>
<issue>1</issue>
<author></author>
<title>Information and Control</title>
<publicationDate>1981</publicationDate>
</host>
<title>A note on the number of queries needed to identify regular languages</title>
<publicationDate>1981</publicationDate>
</json:item>
<json:item>
<author>
<json:item>
<name>Y Sakakibara</name>
</json:item>
</author>
<host>
<volume>76</volume>
<pages>
<last>242</last>
<first>223</first>
</pages>
<issue>2-3</issue>
<author></author>
<title>Theoretical Computer Science</title>
<publicationDate>1990</publicationDate>
</host>
<title>Learning context-free grammars from structural data in polynomial time</title>
<publicationDate>1990</publicationDate>
</json:item>
<json:item>
<author>
<json:item>
<name>F Drewes</name>
</json:item>
<json:item>
<name>J Högberg</name>
</json:item>
</author>
<host>
<pages>
<last>291</last>
<first>279</first>
</pages>
<author></author>
<title>DLT 2003</title>
<publicationDate>2003</publicationDate>
</host>
<title>Learning a regular tree language from a teacher</title>
<publicationDate>2003</publicationDate>
</json:item>
<json:item>
<author>
<json:item>
<name>J Besombes</name>
</json:item>
<json:item>
<name>J.-Y Marion</name>
</json:item>
</author>
<host>
<volume>382</volume>
<pages>
<last>197</last>
<first>183</first>
</pages>
<author></author>
<title>Theoretical Computer Science</title>
<publicationDate>2007</publicationDate>
</host>
<title>Learning tree languages from positive examples and membership queries</title>
<publicationDate>2007</publicationDate>
</json:item>
<json:item>
<author>
<json:item>
<name>F Denis</name>
</json:item>
<json:item>
<name>A Lemay</name>
</json:item>
<json:item>
<name>A Terlutte</name>
</json:item>
</author>
<host>
<pages>
<last>363</last>
<first>348</first>
</pages>
<author></author>
<title>ALT 2001</title>
<publicationDate>2001</publicationDate>
</host>
<title>Learning regular languages using RFSA</title>
<publicationDate>2001</publicationDate>
</json:item>
<json:item>
<author>
<json:item>
<name>B Bollig</name>
</json:item>
<json:item>
<name>P Habermehl</name>
</json:item>
<json:item>
<name>C Kern</name>
</json:item>
<json:item>
<name>M Leucker</name>
</json:item>
</author>
<host>
<author></author>
<title>Online Proceedings of IJCAI</title>
<publicationDate>2009</publicationDate>
</host>
<title>Angluin-style learning of NFA</title>
<publicationDate>2009</publicationDate>
</json:item>
<json:item>
<author>
<json:item>
<name>J Carme</name>
</json:item>
<json:item>
<name>R Gilleron</name>
</json:item>
<json:item>
<name>A Lemay</name>
</json:item>
<json:item>
<name>A Terlutte</name>
</json:item>
<json:item>
<name>M Tommasi</name>
</json:item>
</author>
<host>
<pages>
<last>182</last>
<first>171</first>
</pages>
<author></author>
<title>DLT 2003</title>
</host>
<title>Residual finite tree automata</title>
</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>2011</copyrightDate>
</serie>
<host>
<editor>
<json:item>
<name>Giancarlo Mauri</name>
<affiliations>
<json:string>Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy</json:string>
<json:string>E-mail: mauri@disco.unimib.it</json:string>
</affiliations>
</json:item>
<json:item>
<name>Alberto Leporati</name>
<affiliations>
<json:string>Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy</json:string>
<json:string>E-mail: leporati@disco.unimib.it</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>Algorithm Analysis and Problem Complexity</value>
</json:item>
<json:item>
<value>Computation by Abstract Devices</value>
</json:item>
<json:item>
<value>Mathematical Logic and Formal Languages</value>
</json:item>
<json:item>
<value>Discrete Mathematics in Computer Science</value>
</json:item>
<json:item>
<value>Logics and Meanings of Programs</value>
</json:item>
<json:item>
<value>Artificial Intelligence (incl. Robotics)</value>
</json:item>
</subject>
<isbn>
<json:string>978-3-642-22320-4</json:string>
</isbn>
<language>
<json:string>unknown</json:string>
</language>
<eissn>
<json:string>1611-3349</json:string>
</eissn>
<title>Developments in Language Theory</title>
<bookId>
<json:string>978-3-642-22321-1</json:string>
</bookId>
<volume>6795</volume>
<pages>
<last>477</last>
<first>476</first>
</pages>
<issn>
<json:string>0302-9743</json:string>
</issn>
<genre>
<json:string>book-series</json:string>
</genre>
<eisbn>
<json:string>978-3-642-22321-1</json:string>
</eisbn>
<copyrightDate>2011</copyrightDate>
<doi>
<json:string>10.1007/978-3-642-22321-1</json:string>
</doi>
</host>
<publicationDate>2011</publicationDate>
<copyrightDate>2011</copyrightDate>
<doi>
<json:string>10.1007/978-3-642-22321-1_45</json:string>
</doi>
<id>7EFE870F192FCB69B9275D35FC606D01680A819E</id>
<score>1.0131109</score>
<fulltext>
<json:item>
<extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/document/7EFE870F192FCB69B9275D35FC606D01680A819E/fulltext/pdf</uri>
</json:item>
<json:item>
<extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/document/7EFE870F192FCB69B9275D35FC606D01680A819E/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/7EFE870F192FCB69B9275D35FC606D01680A819E/fulltext/tei">
<teiHeader>
<fileDesc>
<titleStmt>
<title level="a" type="main" xml:lang="en">Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</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 GmbH Berlin Heidelberg, 2011</p>
</availability>
<date>2011</date>
</publicationStmt>
<sourceDesc>
<biblStruct type="inbook">
<analytic>
<title level="a" type="main" xml:lang="en">Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</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 (Theoretical Computer Science), University of Trier, Germany</affiliation>
</author>
</analytic>
<monogr>
<title level="m">Developments in Language Theory</title>
<title level="m" type="sub">15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings</title>
<idno type="pISBN">978-3-642-22320-4</idno>
<idno type="eISBN">978-3-642-22321-1</idno>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="DOI">10.1007/978-3-642-22321-1</idno>
<idno type="book-ID">978-3-642-22321-1</idno>
<idno type="book-title-ID">271647</idno>
<idno type="book-sequence-number">6795</idno>
<idno type="book-volume-number">6795</idno>
<idno type="book-chapter-count">46</idno>
<editor>
<persName>
<forename type="first">Giancarlo</forename>
<surname>Mauri</surname>
</persName>
<email>mauri@disco.unimib.it</email>
<affiliation>Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy</affiliation>
</editor>
<editor>
<persName>
<forename type="first">Alberto</forename>
<surname>Leporati</surname>
</persName>
<email>leporati@disco.unimib.it</email>
<affiliation>Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy</affiliation>
</editor>
<imprint>
<publisher>Springer Berlin Heidelberg</publisher>
<pubPlace>Berlin, Heidelberg</pubPlace>
<date type="published" when="2011"></date>
<biblScope unit="volume">6795</biblScope>
<biblScope unit="page" from="476">476</biblScope>
<biblScope unit="page" to="477">477</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>2011</date>
</biblScope>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="series-Id">558</idno>
</series>
<idno type="istex">7EFE870F192FCB69B9275D35FC606D01680A819E</idno>
<idno type="DOI">10.1007/978-3-642-22321-1_45</idno>
<idno type="ChapterID">45</idno>
<idno type="ChapterID">Chap45</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<creation>
<date>2011</date>
</creation>
<langUsage>
<language ident="en">en</language>
</langUsage>
<abstract xml:lang="en">
<p>Abstract: The area of Grammatical Inference centers on learning algorithms: Algorithms that infer a description (e.g., a grammar or an automaton) for an unknown formal language from given information in finitely many steps. Various conceivable learning settings have been outlined, and based on those a range of algorithms have been developed. One of the language classes studied most extensively with respect to its algorithmical learnability is the class of regular string languages.</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>I16021</label>
<label>I16013</label>
<label>I16048</label>
<label>I17028</label>
<label>I1603X</label>
<label>I21017</label>
<item>
<term>Computer Science</term>
</item>
<item>
<term>Algorithm Analysis and Problem Complexity</term>
</item>
<item>
<term>Computation by Abstract Devices</term>
</item>
<item>
<term>Mathematical Logic and Formal Languages</term>
</item>
<item>
<term>Discrete Mathematics in Computer Science</term>
</item>
<item>
<term>Logics and Meanings of Programs</term>
</item>
<item>
<term>Artificial Intelligence (incl. Robotics)</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc>
<change when="2011">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/7EFE870F192FCB69B9275D35FC606D01680A819E/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-22321-1</BookID>
<BookTitle>Developments in Language Theory</BookTitle>
<BookSubTitle>15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings</BookSubTitle>
<BookVolumeNumber>6795</BookVolumeNumber>
<BookSequenceNumber>6795</BookSequenceNumber>
<BookDOI>10.1007/978-3-642-22321-1</BookDOI>
<BookTitleID>271647</BookTitleID>
<BookPrintISBN>978-3-642-22320-4</BookPrintISBN>
<BookElectronicISBN>978-3-642-22321-1</BookElectronicISBN>
<BookChapterCount>46</BookChapterCount>
<BookCopyright>
<CopyrightHolderName>Springer-Verlag GmbH Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2011</CopyrightYear>
</BookCopyright>
<BookSubjectGroup>
<BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I16021" Priority="1" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject>
<BookSubject Code="I16013" Priority="2" Type="Secondary">Computation by Abstract Devices</BookSubject>
<BookSubject Code="I16048" Priority="3" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject>
<BookSubject Code="I17028" Priority="4" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject>
<BookSubject Code="I1603X" Priority="5" Type="Secondary">Logics and Meanings of Programs</BookSubject>
<BookSubject Code="I21017" Priority="6" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
<BookContext>
<SeriesID>558</SeriesID>
</BookContext>
</BookInfo>
<BookHeader>
<EditorGroup>
<Editor AffiliationIDS="Aff16">
<EditorName DisplayOrder="Western">
<GivenName>Giancarlo</GivenName>
<FamilyName>Mauri</FamilyName>
</EditorName>
<Contact>
<Email>mauri@disco.unimib.it</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff16">
<EditorName DisplayOrder="Western">
<GivenName>Alberto</GivenName>
<FamilyName>Leporati</FamilyName>
</EditorName>
<Contact>
<Email>leporati@disco.unimib.it</Email>
</Contact>
</Editor>
<Affiliation ID="Aff16">
<OrgDivision>Dipartimento di Informatica, Sistemistica e Comunicazione</OrgDivision>
<OrgName>Università degli Studi di Milano-Bicocca</OrgName>
<OrgAddress>
<Street>Viale Sarca 336, Edificio U14</Street>
<Postcode>20126</Postcode>
<City>Milano</City>
<Country>Italy</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</BookHeader>
<Part ID="Part3">
<PartInfo TocLevels="0">
<PartID>3</PartID>
<PartSequenceNumber>3</PartSequenceNumber>
<PartTitle>Short Papers</PartTitle>
<PartChapterCount>7</PartChapterCount>
<PartContext>
<SeriesID>558</SeriesID>
<BookTitle>Developments in Language Theory</BookTitle>
</PartContext>
</PartInfo>
<Chapter ID="Chap45" Language="En">
<ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0">
<ChapterID>45</ChapterID>
<ChapterDOI>10.1007/978-3-642-22321-1_45</ChapterDOI>
<ChapterSequenceNumber>45</ChapterSequenceNumber>
<ChapterTitle Language="En">Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</ChapterTitle>
<ChapterFirstPage>476</ChapterFirstPage>
<ChapterLastPage>477</ChapterLastPage>
<ChapterCopyright>
<CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2011</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>3</PartID>
<BookID>978-3-642-22321-1</BookID>
<BookTitle>Developments in Language Theory</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader>
<AuthorGroup>
<Author AffiliationIDS="Aff17">
<AuthorName DisplayOrder="Western">
<GivenName>Anna</GivenName>
<FamilyName>Kasprzik</FamilyName>
</AuthorName>
<Contact>
<Email>kasprzik@informatik.uni-trier.de</Email>
</Contact>
</Author>
<Affiliation ID="Aff17">
<OrgDivision>FB IV (Theoretical Computer Science)</OrgDivision>
<OrgName>University of Trier</OrgName>
<OrgAddress>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En">
<Heading>Abstract</Heading>
<Para>The area of Grammatical Inference centers on
<Emphasis Type="Italic">learning algorithms</Emphasis>
: Algorithms that infer a description (e.g., a grammar or an automaton) for an unknown formal language from given information in finitely many steps. Various conceivable learning settings have been outlined, and based on those a range of algorithms have been developed. One of the language classes studied most extensively with respect to its algorithmical learnability is the class of regular string languages.</Para>
</Abstract>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6">
<titleInfo lang="en">
<title>Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA" lang="en">
<title>Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</title>
</titleInfo>
<name type="personal">
<namePart type="given">Anna</namePart>
<namePart type="family">Kasprzik</namePart>
<affiliation>FB IV (Theoretical Computer Science), University of Trier, Germany</affiliation>
<affiliation>E-mail: kasprzik@informatik.uni-trier.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">2011</dateIssued>
<copyrightDate encoding="w3cdtf">2011</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 area of Grammatical Inference centers on learning algorithms: Algorithms that infer a description (e.g., a grammar or an automaton) for an unknown formal language from given information in finitely many steps. Various conceivable learning settings have been outlined, and based on those a range of algorithms have been developed. One of the language classes studied most extensively with respect to its algorithmical learnability is the class of regular string languages.</abstract>
<relatedItem type="host">
<titleInfo>
<title>Developments in Language Theory</title>
<subTitle>15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings</subTitle>
</titleInfo>
<name type="personal">
<namePart type="given">Giancarlo</namePart>
<namePart type="family">Mauri</namePart>
<affiliation>Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy</affiliation>
<affiliation>E-mail: mauri@disco.unimib.it</affiliation>
<role>
<roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Alberto</namePart>
<namePart type="family">Leporati</namePart>
<affiliation>Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy</affiliation>
<affiliation>E-mail: leporati@disco.unimib.it</affiliation>
<role>
<roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" displayLabel="Proceedings"></genre>
<originInfo>
<copyrightDate encoding="w3cdtf">2011</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="I16021">Algorithm Analysis and Problem Complexity</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic>
</subject>
<identifier type="DOI">10.1007/978-3-642-22321-1</identifier>
<identifier type="ISBN">978-3-642-22320-4</identifier>
<identifier type="eISBN">978-3-642-22321-1</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="BookTitleID">271647</identifier>
<identifier type="BookID">978-3-642-22321-1</identifier>
<identifier type="BookChapterCount">46</identifier>
<identifier type="BookVolumeNumber">6795</identifier>
<identifier type="BookSequenceNumber">6795</identifier>
<identifier type="PartChapterCount">7</identifier>
<part>
<date>2011</date>
<detail type="part">
<title>Short Papers</title>
</detail>
<detail type="volume">
<number>6795</number>
<caption>vol.</caption>
</detail>
<extent unit="pages">
<start>476</start>
<end>477</end>
</extent>
</part>
<recordInfo>
<recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</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">2011</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 GmbH Berlin Heidelberg, 2011</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">7EFE870F192FCB69B9275D35FC606D01680A819E</identifier>
<identifier type="DOI">10.1007/978-3-642-22321-1_45</identifier>
<identifier type="ChapterID">45</identifier>
<identifier type="ChapterID">Chap45</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag GmbH Berlin Heidelberg, 2011</accessCondition>
<recordInfo>
<recordContentSource>SPRINGER</recordContentSource>
<recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</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 000796 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000796 | 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:7EFE870F192FCB69B9275D35FC606D01680A819E
   |texte=   Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
}}

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024