Waiting time and complexity for matching patterns with automata
Identifieur interne : 00AF88 ( Main/Exploration ); précédent : 00AF87; suivant : 00AF89Waiting time and complexity for matching patterns with automata
Auteurs : M. Crochemore [France, Royaume-Uni] ; V. T. Stefanov [Australie]Source :
- Information processing letters [ 0020-0190 ] ; 2003.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
The paper shows how to compute exactly expectations, standard deviations, and cumulative probabilities of the searching times of string-matching algorithms based on the use of automata. This is derived from a methodology based on viewing the underlying Markov chains as exponential families and applying recent results on them.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 005199
- to stream PascalFrancis, to step Curation: 000F27
- to stream PascalFrancis, to step Checkpoint: 004D43
- to stream Main, to step Merge: 00BD28
- to stream Main, to step Curation: 00AF88
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Waiting time and complexity for matching patterns with automata</title><author><name sortKey="Crochemore, M" sort="Crochemore, M" uniqKey="Crochemore M" first="M." last="Crochemore">M. Crochemore</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institut Gaspard-Monge, University of Marne-la-Vallée</s1><s2>77454 Marne-la-Vallée</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>77454 Marne-la-Vallée</wicri:noRegion><wicri:noRegion>University of Marne-la-Vallée</wicri:noRegion><wicri:noRegion>77454 Marne-la-Vallée</wicri:noRegion></affiliation><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>King's College London</s1><s3>GBR</s3><sZ>1 aut.</sZ></inist:fA14><country>Royaume-Uni</country><wicri:noRegion>King's College London</wicri:noRegion></affiliation></author><author><name sortKey="Stefanov, V T" sort="Stefanov, V T" uniqKey="Stefanov V" first="V. T." last="Stefanov">V. T. Stefanov</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>School of Mathematics and Statistics, The University of Western Australia</s1><s2>Crawley (Perth), WA 6009</s2><s3>AUS</s3><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>Crawley (Perth), WA 6009</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">03-0444336</idno><date when="2003">2003</date><idno type="stanalyst">PASCAL 03-0444336 INIST</idno><idno type="RBID">Pascal:03-0444336</idno><idno type="wicri:Area/PascalFrancis/Corpus">005199</idno><idno type="wicri:Area/PascalFrancis/Curation">000F27</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">004D43</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">004D43</idno><idno type="wicri:doubleKey">0020-0190:2003:Crochemore M:waiting:time:and</idno><idno type="wicri:Area/Main/Merge">00BD28</idno><idno type="wicri:Area/Main/Curation">00AF88</idno><idno type="wicri:Area/Main/Exploration">00AF88</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Waiting time and complexity for matching patterns with automata</title><author><name sortKey="Crochemore, M" sort="Crochemore, M" uniqKey="Crochemore M" first="M." last="Crochemore">M. Crochemore</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Institut Gaspard-Monge, University of Marne-la-Vallée</s1><s2>77454 Marne-la-Vallée</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Île-de-France</region><settlement type="city">Marne-la-Vallée</settlement></placeName></affiliation><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>King's College London</s1><s3>GBR</s3><sZ>1 aut.</sZ></inist:fA14><country>Royaume-Uni</country><wicri:noRegion>King's College London</wicri:noRegion></affiliation></author><author><name sortKey="Stefanov, V T" sort="Stefanov, V T" uniqKey="Stefanov V" first="V. T." last="Stefanov">V. T. Stefanov</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>School of Mathematics and Statistics, The University of Western Australia</s1><s2>Crawley (Perth), WA 6009</s2><s3>AUS</s3><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>Crawley (Perth), WA 6009</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Information processing letters</title><title level="j" type="abbreviated">Inf. process. lett.</title><idno type="ISSN">0020-0190</idno><imprint><date when="2003">2003</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Information processing letters</title><title level="j" type="abbreviated">Inf. process. lett.</title><idno type="ISSN">0020-0190</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Automata theory</term><term>Exponential family</term><term>Formal language</term><term>Information processing</term><term>Markov chain</term><term>Pattern recognition</term><term>Stopping time</term><term>String matching</term><term>Waiting time</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Traitement information</term><term>Chaîne Markov</term><term>Appariement chaîne</term><term>Temps arrêt</term><term>Temps attente</term><term>Langage formel</term><term>Théorie automate</term><term>Algorithme</term><term>Famille exponentielle</term><term>Reconnaissance forme</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The paper shows how to compute exactly expectations, standard deviations, and cumulative probabilities of the searching times of string-matching algorithms based on the use of automata. This is derived from a methodology based on viewing the underlying Markov chains as exponential families and applying recent results on them.</div></front></TEI><affiliations><list><country><li>Australie</li><li>France</li><li>Royaume-Uni</li></country><region><li>Île-de-France</li></region><settlement><li>Marne-la-Vallée</li></settlement></list><tree><country name="France"><region name="Île-de-France"><name sortKey="Crochemore, M" sort="Crochemore, M" uniqKey="Crochemore M" first="M." last="Crochemore">M. Crochemore</name></region></country><country name="Royaume-Uni"><noRegion><name sortKey="Crochemore, M" sort="Crochemore, M" uniqKey="Crochemore M" first="M." last="Crochemore">M. Crochemore</name></noRegion></country><country name="Australie"><noRegion><name sortKey="Stefanov, V T" sort="Stefanov, V T" uniqKey="Stefanov V" first="V. T." last="Stefanov">V. T. Stefanov</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00AF88 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00AF88 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:03-0444336
|texte= Waiting time and complexity for matching patterns with automata
}}
| This area was generated with Dilib version V0.6.33. |  |