Locating Matches of Tree Patterns in Forests
Identifieur interne : 001203 ( Istex/Curation ); précédent : 001202; suivant : 001204Locating Matches of Tree Patterns in Forests
Auteurs : Andreas Neumann [Allemagne] ; Helmut Seidl [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1998.
Abstract
Abstract: We deal with matching and locating of patterns in forests of variable arity. A pattern consists of a structural and a contextual condition for subtrees of a forest, both of which are given as tree or forest regular languages. We use the notation of constraint systems to uniformly specify both kinds of conditions. In order to implement pattern matching we introduce the class of pushdown forest automata. We identify a special class of contexts such that not only pattern matching but also locating all of a forest’s subtrees matching in context can be performed in a single traversal. We also give a method for computing the reachable states of an automaton in order to minimize the size of transition tables.
Url:
DOI: 10.1007/978-3-540-49382-2_12
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001315
Links to Exploration step
ISTEX:4EBE51C251F9ABCEAB9CB94482DC467C5F02286ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Locating Matches of Tree Patterns in Forests</title>
<author><name sortKey="Neumann, Andreas" sort="Neumann, Andreas" uniqKey="Neumann A" first="Andreas" last="Neumann">Andreas Neumann</name>
<affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, University of Trier, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Department of Computer Science, University of Trier</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: neumann@psi.uni-trier.de</mods:affiliation>
<country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, University of Trier, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Department of Computer Science, University of Trier</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation>
<country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:4EBE51C251F9ABCEAB9CB94482DC467C5F02286A</idno>
<date when="1998" year="1998">1998</date>
<idno type="doi">10.1007/978-3-540-49382-2_12</idno>
<idno type="url">https://api.istex.fr/document/4EBE51C251F9ABCEAB9CB94482DC467C5F02286A/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001315</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001315</idno>
<idno type="wicri:Area/Istex/Curation">001203</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Locating Matches of Tree Patterns in Forests</title>
<author><name sortKey="Neumann, Andreas" sort="Neumann, Andreas" uniqKey="Neumann A" first="Andreas" last="Neumann">Andreas Neumann</name>
<affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, University of Trier, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Department of Computer Science, University of Trier</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: neumann@psi.uni-trier.de</mods:affiliation>
<country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, University of Trier, Germany</mods:affiliation>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Department of Computer Science, University of Trier</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation>
<country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>1998</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">4EBE51C251F9ABCEAB9CB94482DC467C5F02286A</idno>
<idno type="DOI">10.1007/978-3-540-49382-2_12</idno>
<idno type="ChapterID">12</idno>
<idno type="ChapterID">Chap12</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: We deal with matching and locating of patterns in forests of variable arity. A pattern consists of a structural and a contextual condition for subtrees of a forest, both of which are given as tree or forest regular languages. We use the notation of constraint systems to uniformly specify both kinds of conditions. In order to implement pattern matching we introduce the class of pushdown forest automata. We identify a special class of contexts such that not only pattern matching but also locating all of a forest’s subtrees matching in context can be performed in a single traversal. We also give a method for computing the reachable states of an automaton in order to minimize the size of transition tables.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001203 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001203 | 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= Curation |type= RBID |clé= ISTEX:4EBE51C251F9ABCEAB9CB94482DC467C5F02286A |texte= Locating Matches of Tree Patterns in Forests }}
This area was generated with Dilib version V0.6.31. |