On distributive fixed-point expressions
Identifieur interne : 002166 ( Main/Exploration ); précédent : 002165; suivant : 002167On distributive fixed-point expressions
Auteurs : H. Seidl [Allemagne] ; D. Niwinski [Pologne]Source :
- Informatique théorique et applications [ 0988-3754 ] ; 1999.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
For every fixed-point expression e of alternation-depth r, we construct a new fixed-point expression e' of alternation-depth 2 and size O(r. |e|). Expression e' is equivalent to e whenever operators are distributive and the underlying complete lattice has a co-continuous least upper bound. We show that our transformation is optimal not only w.r.t. alternation-depth but also w.r.t. the increase in size of the resulting expression.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000F53
- to stream PascalFrancis, to step Curation: 000016
- to stream PascalFrancis, to step Checkpoint: 000D75
- to stream Main, to step Merge: 002527
- to stream Main, to step Curation: 002166
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On distributive fixed-point expressions</title><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author><author><name sortKey="Niwinski, D" sort="Niwinski, D" uniqKey="Niwinski D" first="D." last="Niwinski">D. Niwinski</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Institute of Informatics, University of Warsaw, Ul. Banacha 2</s1><s2>02-097 Warsaw</s2><s3>POL</s3><sZ>2 aut.</sZ></inist:fA14><country>Pologne</country><wicri:noRegion>02-097 Warsaw</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">00-0094212</idno><date when="1999">1999</date><idno type="stanalyst">PASCAL 00-0094212 INIST</idno><idno type="RBID">Pascal:00-0094212</idno><idno type="wicri:Area/PascalFrancis/Corpus">000F53</idno><idno type="wicri:Area/PascalFrancis/Curation">000016</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000D75</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000D75</idno><idno type="wicri:doubleKey">0988-3754:1999:Seidl H:on:distributive:fixed</idno><idno type="wicri:Area/Main/Merge">002527</idno><idno type="wicri:Area/Main/Curation">002166</idno><idno type="wicri:Area/Main/Exploration">002166</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On distributive fixed-point expressions</title><author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author><author><name sortKey="Niwinski, D" sort="Niwinski, D" uniqKey="Niwinski D" first="D." last="Niwinski">D. Niwinski</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Institute of Informatics, University of Warsaw, Ul. Banacha 2</s1><s2>02-097 Warsaw</s2><s3>POL</s3><sZ>2 aut.</sZ></inist:fA14><country>Pologne</country><wicri:noRegion>02-097 Warsaw</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Informatique théorique et applications</title><title level="j" type="abbreviated">Inform. théor. appl.</title><idno type="ISSN">0988-3754</idno><imprint><date when="1999">1999</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Informatique théorique et applications</title><title level="j" type="abbreviated">Inform. théor. appl.</title><idno type="ISSN">0988-3754</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Alternation depth</term><term>Boolean algebra</term><term>Distributivity</term><term>Fix point</term><term>Fixed point expression</term><term>Inductive definition</term><term>Lower bound</term><term>Non deterministic automaton</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Point fixe</term><term>Borne inférieure</term><term>Algèbre Boole</term><term>Automate non déterministe</term><term>Expression point fixe</term><term>Distributivité</term><term>Profondeur alternance</term><term>Définition inductive</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">For every fixed-point expression e of alternation-depth r, we construct a new fixed-point expression e' of alternation-depth 2 and size O(r. |e|). Expression e' is equivalent to e whenever operators are distributive and the underlying complete lattice has a co-continuous least upper bound. We show that our transformation is optimal not only w.r.t. alternation-depth but also w.r.t. the increase in size of the resulting expression.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Pologne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name></noRegion></country><country name="Pologne"><noRegion><name sortKey="Niwinski, D" sort="Niwinski, D" uniqKey="Niwinski D" first="D." last="Niwinski">D. Niwinski</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002166 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002166 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:00-0094212
|texte= On distributive fixed-point expressions
}}
| This area was generated with Dilib version V0.6.31. |  |