InforLorV4, PascalFrancis, Curation, bibRecord, 000B34

Rewriting extended regular expressions

Identifieur interne : 000B34 ( PascalFrancis/Curation ); précédent : 000B33; suivant : 000B35

Rewriting extended regular expressions

Auteurs : V. M. Antimirov [France] ; P. D. Mosses

Source :

Theoretical computer science [ 0304-3975 ] ; 1995.

RBID : Pascal:95-0362414

Descripteurs français

Pascal (Inist)
- Langage rationnel, Inférence, Système réécriture.

English descriptors

KwdEn :
- Inference, Regular language, Rewriting system.

Abstract

We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn-equational axiomatization of the algebra and develop some term-rewriting techniques for constructing logical inferences of valid equations

A01	`01`	`1`		`@0 0304-3975`
A02	`01`			`@0 TCSCDI`
A03		`1`		`@0 Theor. comput. sci.`
A05				`@2 143`
A06				`@2 1`
A08	`01`	`1`	`ENG`	`@1 Rewriting extended regular expressions`
A11	`01`	`1`		`@1 ANTIMIROV (V. M.)`
A11	`02`	`1`		`@1 MOSSES (P. D.)`
A14	`01`			`@1 INRIA-Lorraine/CRIN @2 54602 Villers-lès-Nancy @3 FRA @Z 1 aut.`
A20				`@1 51-72`
A21				`@1 1995`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17243 @5 354000050876560030`
A44				`@0 0000`
A45				`@0 27 ref.`
A47	`01`	`1`		`@0 95-0362414`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Theoretical computer science`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	`@0 We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn-equational axiomatization of the algebra and develop some term-rewriting techniques for constructing logical inferences of valid equations`
C02	`01`	`X`		`@0 001D02A02`
C02	`02`	`X`		`@0 001D02C03`
C03	`01`	`X`	`FRE`	`@0 Langage rationnel @5 21`
C03	`01`	`X`	`ENG`	`@0 Regular language @5 21`
C03	`01`	`X`	`SPA`	`@0 Lenguaje racional @5 21`
C03	`02`	`X`	`FRE`	`@0 Inférence @5 22`
C03	`02`	`X`	`ENG`	`@0 Inference @5 22`
C03	`02`	`X`	`SPA`	`@0 Inferencia @5 22`
C03	`03`	`X`	`FRE`	`@0 Système réécriture @4 CD @5 96`
C03	`03`	`X`	`ENG`	`@0 Rewriting system @4 CD @5 96`
C03	`03`	`X`	`SPA`	`@0 Sistema reescritura @4 CD @5 96`
N21				`@1 205`

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000D60

Links to Exploration step

Pascal:95-0362414

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Rewriting extended regular expressions</title>
<author><name sortKey="Antimirov, V M" sort="Antimirov, V M" uniqKey="Antimirov V" first="V. M." last="Antimirov">V. M. Antimirov</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>INRIA-Lorraine/CRIN</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Mosses, P D" sort="Mosses, P D" uniqKey="Mosses P" first="P. D." last="Mosses">P. D. Mosses</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">95-0362414</idno>
<date when="1995">1995</date>
<idno type="stanalyst">PASCAL 95-0362414 INIST</idno>
<idno type="RBID">Pascal:95-0362414</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000D60</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000B34</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Rewriting extended regular expressions</title>
<author><name sortKey="Antimirov, V M" sort="Antimirov, V M" uniqKey="Antimirov V" first="V. M." last="Antimirov">V. M. Antimirov</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>INRIA-Lorraine/CRIN</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Mosses, P D" sort="Mosses, P D" uniqKey="Mosses P" first="P. D." last="Mosses">P. D. Mosses</name>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="1995">1995</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Inference</term>
<term>Regular language</term>
<term>Rewriting system</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Langage rationnel</term>
<term>Inférence</term>
<term>Système réécriture</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn-equational axiomatization of the algebra and develop some term-rewriting techniques for constructing logical inferences of valid equations</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0304-3975</s0>
</fA01>
<fA02 i1="01"><s0>TCSCDI</s0>
</fA02>
<fA03 i2="1"><s0>Theor. comput. sci.</s0>
</fA03>
<fA05><s2>143</s2>
</fA05>
<fA06><s2>1</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Rewriting extended regular expressions</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>ANTIMIROV (V. M.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>MOSSES (P. D.)</s1>
</fA11>
<fA14 i1="01"><s1>INRIA-Lorraine/CRIN</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA20><s1>51-72</s1>
</fA20>
<fA21><s1>1995</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000050876560030</s5>
</fA43>
<fA44><s0>0000</s0>
</fA44>
<fA45><s0>27 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>95-0362414</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn-equational axiomatization of the algebra and develop some term-rewriting techniques for constructing logical inferences of valid equations</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A02</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02C03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Langage rationnel</s0>
<s5>21</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Regular language</s0>
<s5>21</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Lenguaje racional</s0>
<s5>21</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Inférence</s0>
<s5>22</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Inference</s0>
<s5>22</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Inferencia</s0>
<s5>22</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Système réécriture</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Rewriting system</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Sistema reescritura</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>205</s1>
</fN21>
</pA>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B34 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000B34 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:95-0362414
   |texte=   Rewriting extended regular expressions
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Rewriting extended regular expressions

Rewriting extended regular expressions

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri