On distributive fixed-point expressions
Identifieur interne :
000016 ( PascalFrancis/Curation );
précédent :
000015;
suivant :
000017
On distributive fixed-point expressions
Auteurs : H. Seidl [
Allemagne] ;
D. Niwinski [
Pologne]
Source :
-
Informatique théorique et applications [ 0988-3754 ] ; 1999.
RBID : Pascal:00-0094212
Descripteurs français
English descriptors
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.
| pA |
| A01 | 01 | 1 | | @0 0988-3754 |
|---|
| A02 | 01 | | | @0 RITAE4 |
|---|
| A03 | | 1 | | @0 Inform. théor. appl. |
|---|
| A05 | | | | @2 33 |
|---|
| A06 | | | | @2 4-5 |
|---|
| A08 | 01 | 1 | ENG | @1 On distributive fixed-point expressions |
|---|
| A09 | 01 | 1 | ENG | @1 International Workshop "Fixed Points in Computer Science, FICS'98" |
|---|
| A11 | 01 | 1 | | @1 SEIDL (H.) |
|---|
| A11 | 02 | 1 | | @1 NIWINSKI (D.) |
|---|
| A14 | 01 | | | @1 FB IV - Informatik, Universität Trier @2 54286 Trier @3 DEU @Z 1 aut. |
|---|
| A14 | 02 | | | @1 Institute of Informatics, University of Warsaw, Ul. Banacha 2 @2 02-097 Warsaw @3 POL @Z 2 aut. |
|---|
| A18 | 01 | 1 | | @1 Masaryk University @2 Brno @3 CZE @9 patr. |
|---|
| A18 | 02 | 1 | | @1 József Attila University @2 Szeged @3 HUN @9 patr. |
|---|
| A20 | | | | @1 427-446 |
|---|
| A21 | | | | @1 1999 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A43 | 01 | | | @1 INIST @2 9323B2 @5 354000080995340080 |
|---|
| A44 | | | | @0 0000 @1 © 2000 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 20 ref. |
|---|
| A47 | 01 | 1 | | @0 00-0094212 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Informatique théorique et applications |
|---|
| A66 | 01 | | | @0 FRA |
|---|
| C01 | 01 | | ENG | @0 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. |
|---|
| C02 | 01 | X | | @0 001D02B09 |
|---|
| C02 | 02 | X | | @0 001A02A01D |
|---|
| C02 | 03 | X | | @0 001A02B02 |
|---|
| C02 | 04 | X | | @0 001D02A05 |
|---|
| C03 | 01 | X | FRE | @0 Point fixe @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Fix point @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Punto fijo @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Borne inférieure @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Lower bound @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Cota inferior @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Algèbre Boole @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Boolean algebra @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Algebra Boole @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Automate non déterministe @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Non deterministic automaton @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Autómata no determinista @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Expression point fixe @4 CD @5 96 |
|---|
| C03 | 05 | X | ENG | @0 Fixed point expression @4 CD @5 96 |
|---|
| C03 | 06 | X | FRE | @0 Distributivité @4 CD @5 97 |
|---|
| C03 | 06 | X | ENG | @0 Distributivity @4 CD @5 97 |
|---|
| C03 | 07 | X | FRE | @0 Profondeur alternance @4 CD @5 98 |
|---|
| C03 | 07 | X | ENG | @0 Alternation depth @4 CD @5 98 |
|---|
| C03 | 08 | X | FRE | @0 Définition inductive @4 CD @5 99 |
|---|
| C03 | 08 | X | ENG | @0 Inductive definition @4 CD @5 99 |
|---|
| N21 | | | | @1 066 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Workshop FICS'98 @3 Brno CZE @4 1998-08-27 |
|---|
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000F53
Links to Exploration step
Pascal:00-0094212
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>
</affiliation><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>
</affiliation><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>
</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>
</affiliation><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>
</affiliation><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><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><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><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><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0988-3754</s0>
</fA01><fA02 i1="01"><s0>RITAE4</s0>
</fA02><fA03 i2="1"><s0>Inform. théor. appl.</s0>
</fA03><fA06><s2>4-5</s2>
</fA06><fA08 i1="01" i2="1" l="ENG"><s1>On distributive fixed-point expressions</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>International Workshop "Fixed Points in Computer Science, FICS'98"</s1>
</fA09><fA11 i1="01" i2="1"><s1>SEIDL (H.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>NIWINSKI (D.)</s1>
</fA11><fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14><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>
</fA14><fA18 i1="01" i2="1"><s1>Masaryk University</s1>
<s2>Brno</s2>
<s3>CZE</s3>
<s9>patr.</s9>
</fA18><fA18 i1="02" i2="1"><s1>József Attila University</s1>
<s2>Szeged</s2>
<s3>HUN</s3>
<s9>patr.</s9>
</fA18><fA20><s1>427-446</s1>
</fA20><fA21><s1>1999</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA43 i1="01"><s1>INIST</s1>
<s2>9323B2</s2>
<s5>354000080995340080</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>20 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>00-0094212</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Informatique théorique et applications</s0>
</fA64><fA66 i1="01"><s0>FRA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B09</s0>
</fC02><fC02 i1="02" i2="X"><s0>001A02A01D</s0>
</fC02><fC02 i1="03" i2="X"><s0>001A02B02</s0>
</fC02><fC02 i1="04" i2="X"><s0>001D02A05</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Point fixe</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Fix point</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Punto fijo</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Borne inférieure</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Lower bound</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Cota inferior</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Algèbre Boole</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Boolean algebra</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Algebra Boole</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Automate non déterministe</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Non deterministic automaton</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Autómata no determinista</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Expression point fixe</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Fixed point expression</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Distributivité</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Distributivity</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Profondeur alternance</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Alternation depth</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Définition inductive</s0>
<s4>CD</s4>
<s5>99</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Inductive definition</s0>
<s4>CD</s4>
<s5>99</s5>
</fC03><fN21><s1>066</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>Workshop FICS'98</s1>
<s3>Brno CZE</s3>
<s4>1998-08-27</s4>
</fA30>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000016 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000016 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:00-0094212
|texte= On distributive fixed-point expressions
}}
| This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024 |  |
