A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
Identifieur interne : 000B45 ( Istex/Corpus ); précédent : 000B44; suivant : 000B46A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
Auteurs : Miguel A. Alonso ; Eric De La Clergerie ; Manuel VilaresSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.
Url:
DOI: 10.1007/3-540-48199-0_3
Links to Exploration step
ISTEX:30F7241BCD48DAE7BF8D6D0637F7686A2FAA80BELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique</title>
<author><name sortKey="Alonso, Miguel A" sort="Alonso, Miguel A" uniqKey="Alonso M" first="Miguel A." last="Alonso">Miguel A. Alonso</name>
<affiliation><mods:affiliation>Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: alonso@dc.fi.udc.es</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="De La Clergerie, Eric" sort="De La Clergerie, Eric" uniqKey="De La Clergerie E" first="Eric" last="De La Clergerie">Eric De La Clergerie</name>
<affiliation><mods:affiliation>Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquecourt, B.P. 105, 78153, Le Chesnay Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Eric.De_La_Clergerie@inria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Vilares, Manuel" sort="Vilares, Manuel" uniqKey="Vilares M" first="Manuel" last="Vilares">Manuel Vilares</name>
<affiliation><mods:affiliation>E-mail: vilares@dc.fi.udc.es</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:30F7241BCD48DAE7BF8D6D0637F7686A2FAA80BE</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1007/3-540-48199-0_3</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-8C6JTHKK-1/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000B45</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000B45</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique</title>
<author><name sortKey="Alonso, Miguel A" sort="Alonso, Miguel A" uniqKey="Alonso M" first="Miguel A." last="Alonso">Miguel A. Alonso</name>
<affiliation><mods:affiliation>Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: alonso@dc.fi.udc.es</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="De La Clergerie, Eric" sort="De La Clergerie, Eric" uniqKey="De La Clergerie E" first="Eric" last="De La Clergerie">Eric De La Clergerie</name>
<affiliation><mods:affiliation>Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquecourt, B.P. 105, 78153, Le Chesnay Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Eric.De_La_Clergerie@inria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Vilares, Manuel" sort="Vilares, Manuel" uniqKey="Vilares M" first="Manuel" last="Vilares">Manuel Vilares</name>
<affiliation><mods:affiliation>E-mail: vilares@dc.fi.udc.es</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.</div>
</front>
</TEI>
<istex><corpusName>springer-ebooks</corpusName>
<author><json:item><name>Miguel A. Alonso</name>
<affiliations><json:string>Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain</json:string>
<json:string>E-mail: alonso@dc.fi.udc.es</json:string>
</affiliations>
</json:item>
<json:item><name>Eric de la Clergerie</name>
<affiliations><json:string>Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquecourt, B.P. 105, 78153, Le Chesnay Cedex, France</json:string>
<json:string>E-mail: Eric.De_La_Clergerie@inria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Manuel Vilares</name>
<affiliations><json:string>E-mail: vilares@dc.fi.udc.es</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/HCB-8C6JTHKK-1</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.</abstract>
<qualityIndicators><score>8.176</score>
<pdfWordCount>6858</pdfWordCount>
<pdfCharCount>31707</pdfCharCount>
<pdfVersion>1.3</pdfVersion>
<pdfPageCount>18</pdfPageCount>
<pdfPageSize>431 x 666 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<abstractWordCount>98</abstractWordCount>
<abstractCharCount>639</abstractCharCount>
<keywordCount>0</keywordCount>
</qualityIndicators>
<title>A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique</title>
<chapterId><json:string>3</json:string>
<json:string>Chap3</json:string>
</chapterId>
<genre><json:string>conference</json:string>
</genre>
<serie><title>Lecture Notes in Computer Science</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2001</copyrightDate>
<issn><json:string>0302-9743</json:string>
</issn>
<editor><json:item><name>G. Goos</name>
</json:item>
<json:item><name>J. Hartmanis</name>
</json:item>
<json:item><name>J. van Leeuwen</name>
</json:item>
</editor>
</serie>
<host><title>Logical Aspects of Computational Linguistics</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2001</copyrightDate>
<doi><json:string>10.1007/3-540-48199-0</json:string>
</doi>
<issn><json:string>0302-9743</json:string>
</issn>
<eisbn><json:string>978-3-540-48199-7</json:string>
</eisbn>
<bookId><json:string>3-540-48199-0</json:string>
</bookId>
<isbn><json:string>978-3-540-42273-0</json:string>
</isbn>
<volume>2099</volume>
<pages><first>44</first>
<last>61</last>
</pages>
<genre><json:string>book-series</json:string>
</genre>
<editor><json:item><name>Philippe de Groote</name>
<affiliations><json:string>INRIA Lorraine, 615 rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy Cedex, France</json:string>
<json:string>E-mail: Philippe.deGroote@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Glyn Morrill</name>
<affiliations><json:string>Universitat Politècnica de Catalunya, Jordi Girona Salgado, 1-3, 08028, Barcelona, Spain</json:string>
<json:string>E-mail: morrill@lsi.upc.es</json:string>
</affiliations>
</json:item>
<json:item><name>Christian Retoré</name>
<affiliations><json:string>Faculté des Sciences, Institut de recherche en Informatique de Nantes (IRIN), 2, rue de la Houssinière, B.P. 92208, 44322, Nantes Cedex 03, France</json:string>
<json:string>E-mail: retore@irisa.fr</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>Artificial Intelligence (incl. Robotics)</value>
</json:item>
<json:item><value>Mathematical Logic and Formal Languages</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/HCB-8C6JTHKK-1</json:string>
</ark>
<publicationDate>2001</publicationDate>
<copyrightDate>2001</copyrightDate>
<doi><json:string>10.1007/3-540-48199-0_3</json:string>
</doi>
<id>30F7241BCD48DAE7BF8D6D0637F7686A2FAA80BE</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-8C6JTHKK-1/fulltext.pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-8C6JTHKK-1/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-8C6JTHKK-1/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<availability><licence>Springer-Verlag Berlin Heidelberg</licence>
</availability>
<date when="2001">2001</date>
</publicationStmt>
<notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note>
<note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique</title>
<author><persName><forename type="first">Miguel</forename>
<forename type="first">A.</forename>
<surname>Alonso</surname>
</persName>
<email>alonso@dc.fi.udc.es</email>
<affiliation><orgName type="department">Departamento de Computación</orgName>
<orgName type="institution">Universidad de La Coruña</orgName>
<address><street>Campus de Elviña s/n</street>
<postCode>15071</postCode>
<settlement>La Coruña</settlement>
<country key="ES">SPAIN</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Eric</forename>
<nameLink>de la</nameLink>
<surname>Clergerie</surname>
</persName>
<email>Eric.De_La_Clergerie@inria.fr</email>
<affiliation><orgName type="institution">Institut National de Recherche en Informatique et en Automatique</orgName>
<address><street>Domaine de Voluceau, Rocquecourt, B.P. 105</street>
<postCode>78153</postCode>
<settlement>Le Chesnay Cedex</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Manuel</forename>
<surname>Vilares</surname>
</persName>
<email>vilares@dc.fi.udc.es</email>
</author>
<idno type="istex">30F7241BCD48DAE7BF8D6D0637F7686A2FAA80BE</idno>
<idno type="ark">ark:/67375/HCB-8C6JTHKK-1</idno>
<idno type="DOI">10.1007/3-540-48199-0_3</idno>
</analytic>
<monogr><title level="m" type="main">Logical Aspects of Computational Linguistics</title>
<title level="m" type="sub">4th International Conference, LACL 2001 Le Croisic, France, June 27–29, 2001 Proceedings</title>
<title level="m" type="part">Contributed Papers</title>
<idno type="DOI">10.1007/3-540-48199-0</idno>
<idno type="book-id">3-540-48199-0</idno>
<idno type="ISBN">978-3-540-42273-0</idno>
<idno type="eISBN">978-3-540-48199-7</idno>
<idno type="chapter-id">Chap3</idno>
<idno type="part-id">Part2</idno>
<editor><persName><forename type="first">Philippe</forename>
<nameLink>de</nameLink>
<surname>Groote</surname>
</persName>
<email>Philippe.deGroote@loria.fr</email>
<affiliation><orgName type="institution">INRIA Lorraine</orgName>
<address><street>615 rue du Jardin Botanique</street>
<postBox>B.P. 101</postBox>
<postCode>54602</postCode>
<settlement>Villers-lès-Nancy Cedex</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Glyn</forename>
<surname>Morrill</surname>
</persName>
<email>morrill@lsi.upc.es</email>
<affiliation><orgName type="institution">Universitat Politècnica de Catalunya</orgName>
<address><street>Jordi Girona Salgado, 1-3</street>
<postCode>08028</postCode>
<settlement>Barcelona</settlement>
<country key="ES">SPAIN</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Christian</forename>
<surname>Retoré</surname>
</persName>
<email>retore@irisa.fr</email>
<affiliation><orgName type="department">Faculté des Sciences</orgName>
<orgName type="institution">Institut de recherche en Informatique de Nantes (IRIN)</orgName>
<address><street>2, rue de la Houssinière</street>
<postBox>B.P. 92208</postBox>
<postCode>44322</postCode>
<settlement>Nantes Cedex 03</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</editor>
<imprint><biblScope unit="vol">2099</biblScope>
<biblScope unit="page" from="44">44</biblScope>
<biblScope unit="page" to="61">61</biblScope>
<biblScope unit="chapter-count">18</biblScope>
<biblScope unit="part-chapter-count">16</biblScope>
</imprint>
</monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">G.</forename>
<surname>Goos</surname>
</persName>
</editor>
<editor><persName><forename type="first">J.</forename>
<surname>Hartmanis</surname>
</persName>
</editor>
<editor><persName><forename type="first">J.</forename>
<nameLink>van</nameLink>
<surname>Leeuwen</surname>
</persName>
</editor>
<idno type="pISSN">0302-9743</idno>
<idno type="seriesID">558</idno>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><abstract xml:lang="en"><head>Abstract</head>
<p>The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.</p>
</abstract>
<textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label>
<item><term type="Primary">Computer Science</term>
</item>
<label>I21017</label>
<item><term type="Secondary" subtype="priority-1">Artificial Intelligence (incl. Robotics)</term>
</item>
<label>I16048</label>
<item><term type="Secondary" subtype="priority-2">Mathematical Logic and Formal Languages</term>
</item>
</list>
</keywords>
</textClass>
<langUsage><language ident="EN"></language>
</langUsage>
</profileDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-8C6JTHKK-1/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not 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>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName>
<FamilyName>Goos</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName>
<FamilyName>Hartmanis</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName>
<Particle>van</Particle>
<FamilyName>Leeuwen</FamilyName>
</EditorName>
</Editor>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-48199-0</BookID>
<BookTitle>Logical Aspects of Computational Linguistics</BookTitle>
<BookSubTitle>4th International Conference, LACL 2001 Le Croisic, France, June 27–29, 2001 Proceedings</BookSubTitle>
<BookVolumeNumber>2099</BookVolumeNumber>
<BookSequenceNumber>2099</BookSequenceNumber>
<BookDOI>10.1007/3-540-48199-0</BookDOI>
<BookTitleID>69388</BookTitleID>
<BookPrintISBN>978-3-540-42273-0</BookPrintISBN>
<BookElectronicISBN>978-3-540-48199-7</BookElectronicISBN>
<BookChapterCount>18</BookChapterCount>
<BookHistory><OnlineDate><Year>2001</Year>
<Month>6</Month>
<Day>13</Day>
</OnlineDate>
</BookHistory>
<BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2001</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject>
<BookSubject Code="I16048" Priority="2" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
<BookContext><SeriesID>558</SeriesID>
</BookContext>
</BookInfo>
<BookHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Philippe</GivenName>
<Particle>de</Particle>
<FamilyName>Groote</FamilyName>
</EditorName>
<Contact><Email>Philippe.deGroote@loria.fr</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Glyn</GivenName>
<FamilyName>Morrill</FamilyName>
</EditorName>
<Contact><Email>morrill@lsi.upc.es</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Christian</GivenName>
<FamilyName>Retoré</FamilyName>
</EditorName>
<Contact><Email>retore@irisa.fr</Email>
</Contact>
</Editor>
<Affiliation ID="Aff1"><OrgName>INRIA Lorraine</OrgName>
<OrgAddress><Street>615 rue du Jardin Botanique</Street>
<Postbox>B.P. 101</Postbox>
<Postcode>54602</Postcode>
<City>Villers-lès-Nancy Cedex</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>Universitat Politècnica de Catalunya</OrgName>
<OrgAddress><Street>Jordi Girona Salgado, 1-3</Street>
<Postcode>08028</Postcode>
<City>Barcelona</City>
<Country>Spain</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff3"><OrgDivision>Faculté des Sciences</OrgDivision>
<OrgName>Institut de recherche en Informatique de Nantes (IRIN)</OrgName>
<OrgAddress><Street>2, rue de la Houssinière</Street>
<Postbox>B.P. 92208</Postbox>
<Postcode>44322</Postcode>
<City>Nantes Cedex 03</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</BookHeader>
<Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID>
<PartSequenceNumber>2</PartSequenceNumber>
<PartTitle>Contributed Papers</PartTitle>
<PartChapterCount>16</PartChapterCount>
<PartContext><SeriesID>558</SeriesID>
<BookID>3-540-48199-0</BookID>
<BookTitle>Logical Aspects of Computational Linguistics</BookTitle>
</PartContext>
</PartInfo>
<Chapter ID="Chap3" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>3</ChapterID>
<ChapterDOI>10.1007/3-540-48199-0_3</ChapterDOI>
<ChapterSequenceNumber>3</ChapterSequenceNumber>
<ChapterTitle Language="En">A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique</ChapterTitle>
<ChapterFirstPage>44</ChapterFirstPage>
<ChapterLastPage>61</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2001</CopyrightYear>
</ChapterCopyright>
<ChapterHistory><RegistrationDate><Year>2001</Year>
<Month>6</Month>
<Day>12</Day>
</RegistrationDate>
<OnlineDate><Year>2001</Year>
<Month>6</Month>
<Day>13</Day>
</OnlineDate>
</ChapterHistory>
<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>3-540-48199-0</BookID>
<BookTitle>Logical Aspects of Computational Linguistics</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff8"><AuthorName DisplayOrder="Western"><GivenName>Miguel</GivenName>
<GivenName>A.</GivenName>
<FamilyName>Alonso</FamilyName>
</AuthorName>
<Contact><Email>alonso@dc.fi.udc.es</Email>
<URL>http://coleweb.dc.fi.udc.es/</URL>
</Contact>
</Author>
<Author AffiliationIDS="Aff9"><AuthorName DisplayOrder="Western"><GivenName>Eric</GivenName>
<Particle>de la</Particle>
<FamilyName>Clergerie</FamilyName>
</AuthorName>
<Contact><Email>Eric.De_La_Clergerie@inria.fr</Email>
<URL>http://atoll.inria.fr/</URL>
</Contact>
</Author>
<Author><AuthorName DisplayOrder="Western"><GivenName>Manuel</GivenName>
<FamilyName>Vilares</FamilyName>
</AuthorName>
<Contact><Email>vilares@dc.fi.udc.es</Email>
</Contact>
</Author>
<Affiliation ID="Aff8"><OrgDivision>Departamento de Computación</OrgDivision>
<OrgName>Universidad de La Coruña</OrgName>
<OrgAddress><Street>Campus de Elviña s/n</Street>
<Postcode>15071</Postcode>
<City>La Coruña</City>
<Country>Spain</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff9"><OrgName>Institut National de Recherche en Informatique et en Automatique</OrgName>
<OrgAddress><Street>Domaine de Voluceau, Rocquecourt, B.P. 105</Street>
<Postcode>78153</Postcode>
<City>Le Chesnay Cedex</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.</Para>
</Abstract>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
<SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID>
<SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle>
<SubSeriesSubTitle Language="En">Subseries of Lecture Notes in Computer Science</SubSeriesSubTitle>
</SubSeriesInfo>
<SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jaime</GivenName>
<GivenName>G.</GivenName>
<FamilyName>Carbonell</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName>
<FamilyName>Siekmann</FamilyName>
</EditorName>
</Editor>
<Affiliation ID="Aff4"><OrgName>Carnegie Mellon University</OrgName>
<OrgAddress><City>Pittsburgh</City>
<State>PA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff5"><OrgName>University of Saarland</OrgName>
<OrgAddress><City>Saabrücken</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</SubSeriesHeader>
</SubSeries>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique</title>
</titleInfo>
<name type="personal"><namePart type="given">Miguel</namePart>
<namePart type="given">A.</namePart>
<namePart type="family">Alonso</namePart>
<affiliation>Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain</affiliation>
<affiliation>E-mail: alonso@dc.fi.udc.es</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Eric</namePart>
<namePart type="family">de la Clergerie</namePart>
<affiliation>Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquecourt, B.P. 105, 78153, Le Chesnay Cedex, France</affiliation>
<affiliation>E-mail: Eric.De_La_Clergerie@inria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Manuel</namePart>
<namePart type="family">Vilares</namePart>
<affiliation>E-mail: vilares@dc.fi.udc.es</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2001</dateIssued>
<copyrightDate encoding="w3cdtf">2001</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.</abstract>
<relatedItem type="host"><titleInfo><title>Logical Aspects of Computational Linguistics</title>
<subTitle>4th International Conference, LACL 2001 Le Croisic, France, June 27–29, 2001 Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Philippe</namePart>
<namePart type="family">de Groote</namePart>
<affiliation>INRIA Lorraine, 615 rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy Cedex, France</affiliation>
<affiliation>E-mail: Philippe.deGroote@loria.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Glyn</namePart>
<namePart type="family">Morrill</namePart>
<affiliation>Universitat Politècnica de Catalunya, Jordi Girona Salgado, 1-3, 08028, Barcelona, Spain</affiliation>
<affiliation>E-mail: morrill@lsi.upc.es</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Christian</namePart>
<namePart type="family">Retoré</namePart>
<affiliation>Faculté des Sciences, Institut de recherche en Informatique de Nantes (IRIN), 2, rue de la Houssinière, B.P. 92208, 44322, Nantes Cedex 03, France</affiliation>
<affiliation>E-mail: retore@irisa.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2001</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="I21017">Artificial Intelligence (incl. Robotics)</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic>
</subject>
<identifier type="DOI">10.1007/3-540-48199-0</identifier>
<identifier type="ISBN">978-3-540-42273-0</identifier>
<identifier type="eISBN">978-3-540-48199-7</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="BookTitleID">69388</identifier>
<identifier type="BookID">3-540-48199-0</identifier>
<identifier type="BookChapterCount">18</identifier>
<identifier type="BookVolumeNumber">2099</identifier>
<identifier type="BookSequenceNumber">2099</identifier>
<identifier type="PartChapterCount">16</identifier>
<part><date>2001</date>
<detail type="part"><title>Contributed Papers</title>
</detail>
<detail type="volume"><number>2099</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>44</start>
<end>61</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
</titleInfo>
<name type="personal"><namePart type="given">G.</namePart>
<namePart type="family">Goos</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">J.</namePart>
<namePart type="family">Hartmanis</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">J.</namePart>
<namePart type="family">van Leeuwen</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2001</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title>
<subTitle>Subseries of Lecture Notes in Computer Science</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">G.</namePart>
<namePart type="family">Goos</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">J.</namePart>
<namePart type="family">Hartmanis</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">J.</namePart>
<namePart type="family">van Leeuwen</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Philippe</namePart>
<namePart type="family">de Groote</namePart>
<affiliation>INRIA Lorraine, 615 rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy Cedex, France</affiliation>
<affiliation>E-mail: Philippe.deGroote@loria.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Glyn</namePart>
<namePart type="family">Morrill</namePart>
<affiliation>Universitat Politècnica de Catalunya, Jordi Girona Salgado, 1-3, 08028, Barcelona, Spain</affiliation>
<affiliation>E-mail: morrill@lsi.upc.es</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Christian</namePart>
<namePart type="family">Retoré</namePart>
<affiliation>Faculté des Sciences, Institut de recherche en Informatique de Nantes (IRIN), 2, rue de la Houssinière, B.P. 92208, 44322, Nantes Cedex 03, France</affiliation>
<affiliation>E-mail: retore@irisa.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jaime</namePart>
<namePart type="given">G.</namePart>
<namePart type="family">Carbonell</namePart>
<affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jörg</namePart>
<namePart type="family">Siekmann</namePart>
<affiliation>University of Saarland, Saabrücken, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="sub-series"></genre>
<identifier type="SubSeriesID">1244</identifier>
</relatedItem>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">30F7241BCD48DAE7BF8D6D0637F7686A2FAA80BE</identifier>
<identifier type="ark">ark:/67375/HCB-8C6JTHKK-1</identifier>
<identifier type="DOI">10.1007/3-540-48199-0_3</identifier>
<identifier type="ChapterID">3</identifier>
<identifier type="ChapterID">Chap3</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2001</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource>
<recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-8C6JTHKK-1/record.json</uri>
</json:item>
</metadata>
</istex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B45 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000B45 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Corpus |type= RBID |clé= ISTEX:30F7241BCD48DAE7BF8D6D0637F7686A2FAA80BE |texte= A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |