A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
Identifieur interne : 000B39 ( Istex/Curation ); précédent : 000B38; suivant : 000B40A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
Auteurs : Miguel A. Alonso [Espagne] ; Eric De La Clergerie [France] ; Manuel Vilares [Espagne]Source :
- 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 toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000B45
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 wicri:level="1"><mods:affiliation>Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain</mods:affiliation><country xml:lang="fr">Espagne</country><wicri:regionArea>Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: alonso@dc.fi.udc.es</mods:affiliation><country wicri:rule="url">Espagne</country></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 wicri:level="1"><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><country xml:lang="fr">France</country><wicri:regionArea>Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquecourt, B.P. 105, 78153, Le Chesnay Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: Eric.De_La_Clergerie@inria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Vilares, Manuel" sort="Vilares, Manuel" uniqKey="Vilares M" first="Manuel" last="Vilares">Manuel Vilares</name><affiliation wicri:level="1"><mods:affiliation>E-mail: vilares@dc.fi.udc.es</mods:affiliation><country wicri:rule="url">Espagne</country></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><idno type="wicri:Area/Istex/Curation">000B39</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 wicri:level="1"><mods:affiliation>Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain</mods:affiliation><country xml:lang="fr">Espagne</country><wicri:regionArea>Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: alonso@dc.fi.udc.es</mods:affiliation><country wicri:rule="url">Espagne</country></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 wicri:level="1"><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><country xml:lang="fr">France</country><wicri:regionArea>Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquecourt, B.P. 105, 78153, Le Chesnay Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: Eric.De_La_Clergerie@inria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Vilares, Manuel" sort="Vilares, Manuel" uniqKey="Vilares M" first="Manuel" last="Vilares">Manuel Vilares</name><affiliation wicri:level="1"><mods:affiliation>E-mail: vilares@dc.fi.udc.es</mods:affiliation><country wicri:rule="url">Espagne</country></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></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B39 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 000B39 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Curation
|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. |  |