The complexity of testing ground reducibility for linear word rewriting systems with variables
Identifieur interne : 003C39 ( Istex/Corpus ); précédent : 003C38; suivant : 003C40The complexity of testing ground reducibility for linear word rewriting systems with variables
Auteurs : Gregory Kucherov ; Michaël RusinowitchSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In [9] we proved that for a word rewriting system with variables $$x\mathcal{R}$$ and a word with variables Ω, it is undecidable if Ω is ground reducible by $$x\mathcal{R}$$ , that is if all the instances of Ω obtained by substituting its variables by non-empty words are reducible by $$x\mathcal{R}$$ . On the other hand, if $$x\mathcal{R}$$ is linear, the question is decidable for arbitrary (linear or non-linear) Ω. In this paper we futher study the complexity of the above problem and prove that it is co-NP-complete if both $$x\mathcal{R}$$ and Ω are restricted to be linear. The proof is based on the construction of a deterministic finite automaton for the language of words reducible by $$x\mathcal{R}$$ . The construction generalizes the well-known Aho-Corasick automaton for string matching against a set of keywords.
Url:
DOI: 10.1007/3-540-60381-6_16
Links to Exploration step
ISTEX:FBA4E50079058BCCEE4BBF728E33F6DC3A91E82ELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The complexity of testing ground reducibility for linear word rewriting systems with variables</title><author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name><affiliation><mods:affiliation>INRIA-Lorraine and CRIN, 615, rue du Jardin Botanique, BP 101, 54506, Vandœuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kucherov@1oria.fr</mods:affiliation></affiliation></author><author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name><affiliation><mods:affiliation>INRIA-Lorraine and CRIN, 615, rue du Jardin Botanique, BP 101, 54506, Vandœuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: rusi@1oria.fr</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:FBA4E50079058BCCEE4BBF728E33F6DC3A91E82E</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1007/3-540-60381-6_16</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-RW443W7H-B/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003C39</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003C39</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The complexity of testing ground reducibility for linear word rewriting systems with variables</title><author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name><affiliation><mods:affiliation>INRIA-Lorraine and CRIN, 615, rue du Jardin Botanique, BP 101, 54506, Vandœuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kucherov@1oria.fr</mods:affiliation></affiliation></author><author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name><affiliation><mods:affiliation>INRIA-Lorraine and CRIN, 615, rue du Jardin Botanique, BP 101, 54506, Vandœuvre-lès-Nancy, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: rusi@1oria.fr</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In [9] we proved that for a word rewriting system with variables $$x\mathcal{R}$$ and a word with variables Ω, it is undecidable if Ω is ground reducible by $$x\mathcal{R}$$ , that is if all the instances of Ω obtained by substituting its variables by non-empty words are reducible by $$x\mathcal{R}$$ . On the other hand, if $$x\mathcal{R}$$ is linear, the question is decidable for arbitrary (linear or non-linear) Ω. In this paper we futher study the complexity of the above problem and prove that it is co-NP-complete if both $$x\mathcal{R}$$ and Ω are restricted to be linear. The proof is based on the construction of a deterministic finite automaton for the language of words reducible by $$x\mathcal{R}$$ . The construction generalizes the well-known Aho-Corasick automaton for string matching against a set of keywords.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Gregory Kucherov</name><affiliations><json:string>INRIA-Lorraine and CRIN, 615, rue du Jardin Botanique, BP 101, 54506, Vandœuvre-lès-Nancy, France</json:string><json:string>E-mail: kucherov@1oria.fr</json:string></affiliations></json:item><json:item><name>Michaël Rusinowitch</name><affiliations><json:string>INRIA-Lorraine and CRIN, 615, rue du Jardin Botanique, BP 101, 54506, Vandœuvre-lès-Nancy, France</json:string><json:string>E-mail: rusi@1oria.fr</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-RW443W7H-B</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: In [9] we proved that for a word rewriting system with variables $$x\mathcal{R}$$ and a word with variables Ω, it is undecidable if Ω is ground reducible by $$x\mathcal{R}$$ , that is if all the instances of Ω obtained by substituting its variables by non-empty words are reducible by $$x\mathcal{R}$$ . On the other hand, if $$x\mathcal{R}$$ is linear, the question is decidable for arbitrary (linear or non-linear) Ω. In this paper we futher study the complexity of the above problem and prove that it is co-NP-complete if both $$x\mathcal{R}$$ and Ω are restricted to be linear. The proof is based on the construction of a deterministic finite automaton for the language of words reducible by $$x\mathcal{R}$$ . The construction generalizes the well-known Aho-Corasick automaton for string matching against a set of keywords.</abstract><qualityIndicators><score>8.608</score><pdfWordCount>6376</pdfWordCount><pdfCharCount>28432</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>14</pdfPageCount><pdfPageSize>439.28 x 662.28 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>134</abstractWordCount><abstractCharCount>838</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>The complexity of testing ground reducibility for linear word rewriting systems with variables</title><chapterId><json:string>16</json:string><json:string>Chap16</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1995</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item><json:item><name>Jan van Leeuwen</name></json:item></editor></serie><host><title>Conditional and Typed Rewriting Systems</title><language><json:string>unknown</json:string></language><copyrightDate>1995</copyrightDate><doi><json:string>10.1007/3-540-60381-6</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-45513-4</json:string></eisbn><bookId><json:string>3540603816</json:string></bookId><isbn><json:string>978-3-540-60381-8</json:string></isbn><volume>968</volume><pages><first>262</first><last>275</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Nachum Dershowitz</name></json:item><json:item><name>Naomi Lindenstrauss</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-RW443W7H-B</json:string></ark><publicationDate>1995</publicationDate><copyrightDate>1995</copyrightDate><doi><json:string>10.1007/3-540-60381-6_16</json:string></doi><id>FBA4E50079058BCCEE4BBF728E33F6DC3A91E82E</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-RW443W7H-B/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-RW443W7H-B/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-RW443W7H-B/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">The complexity of testing ground reducibility for linear word rewriting systems with variables</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1995">1995</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The complexity of testing ground reducibility for linear word rewriting systems with variables</title><author><persName><forename type="first">Gregory</forename><surname>Kucherov</surname></persName><email>kucherov@1oria.fr</email><affiliation><orgName type="institution">INRIA-Lorraine and CRIN</orgName><address><street>615, rue du Jardin Botanique</street><postBox>BP 101</postBox><postCode>54506</postCode><settlement>Vandœuvre-lès-Nancy</settlement><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">Michaël</forename><surname>Rusinowitch</surname></persName><email>rusi@1oria.fr</email><affiliation><orgName type="institution">INRIA-Lorraine and CRIN</orgName><address><street>615, rue du Jardin Botanique</street><postBox>BP 101</postBox><postCode>54506</postCode><settlement>Vandœuvre-lès-Nancy</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">FBA4E50079058BCCEE4BBF728E33F6DC3A91E82E</idno><idno type="ark">ark:/67375/HCB-RW443W7H-B</idno><idno type="DOI">10.1007/3-540-60381-6_16</idno></analytic><monogr><title level="m" type="main">Conditional and Typed Rewriting Systems</title><title level="m" type="sub">4th International Workshop, CTRS-94 Jerusalem, Israel, July 13–15, 1994 Proceedings</title><idno type="DOI">10.1007/3-540-60381-6</idno><idno type="book-id">3540603816</idno><idno type="ISBN">978-3-540-60381-8</idno><idno type="eISBN">978-3-540-45513-4</idno><idno type="chapter-id">Chap16</idno><editor><persName><forename type="first">Nachum</forename><surname>Dershowitz</surname></persName></editor><editor><persName><forename type="first">Naomi</forename><surname>Lindenstrauss</surname></persName></editor><imprint><biblScope unit="vol">968</biblScope><biblScope unit="page" from="262">262</biblScope><biblScope unit="page" to="275">275</biblScope><biblScope unit="chapter-count">21</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">Jan</forename><nameLink>van</nameLink><surname>Leeuwen</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>In [9] we proved that for a word rewriting system with variables <formula xml:id="IE1" notation="TEX"><media mimeType="image" url=""></media>
$$x\mathcal{R}$$
</formula> and a word with variables <hi rend="italic">Ω</hi>, it is undecidable if <hi rend="italic">Ω</hi> is ground reducible by <formula xml:id="IE2" notation="TEX"><media mimeType="image" url=""></media>
$$x\mathcal{R}$$
</formula>, that is if all the instances of <hi rend="italic">Ω</hi> obtained by substituting its variables by non-empty words are reducible by <formula xml:id="IE3" notation="TEX"><media mimeType="image" url=""></media>
$$x\mathcal{R}$$
</formula>. On the other hand, if <formula xml:id="IE4" notation="TEX"><media mimeType="image" url=""></media>
$$x\mathcal{R}$$
</formula> is linear, the question is decidable for arbitrary (linear or non-linear) <hi rend="italic">Ω</hi>. In this paper we futher study the complexity of the above problem and prove that it is <hi rend="italic">co-NP</hi>-complete if both <formula xml:id="IE5" notation="TEX"><media mimeType="image" url=""></media>
$$x\mathcal{R}$$
</formula> and <hi rend="italic">Ω</hi> are restricted to be linear. The proof is based on the construction of a deterministic finite automaton for the language of words reducible by <formula xml:id="IE6" notation="TEX"><media mimeType="image" url=""></media>
$$x\mathcal{R}$$
</formula>. The construction generalizes the well-known Aho-Corasick automaton for string matching against a set of keywords.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-1">Mathematical Logic and Formal Languages</term></item><label>I14037</label><item><term type="Secondary" subtype="priority-2">Programming Languages, Compilers, Interpreters</term></item><label>I21017</label><item><term type="Secondary" subtype="priority-3">Artificial Intelligence (incl. Robotics)</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-4">Logics and Meanings of Programs</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-RW443W7H-B/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540603816</BookID><BookTitle>Conditional and Typed Rewriting Systems</BookTitle><BookSubTitle>4th International Workshop, CTRS-94 Jerusalem, Israel, July 13–15, 1994 Proceedings</BookSubTitle><BookVolumeNumber>968</BookVolumeNumber><BookDOI>10.1007/3-540-60381-6</BookDOI><BookTitleID>42637</BookTitleID><BookPrintISBN>978-3-540-60381-8</BookPrintISBN><BookElectronicISBN>978-3-540-45513-4</BookElectronicISBN><BookChapterCount>21</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1995</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16048" Priority="1" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I14037" Priority="2" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I21017" Priority="3" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I1603X" Priority="4" Type="Secondary">Logics and Meanings of Programs</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Nachum</GivenName><FamilyName>Dershowitz</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Naomi</GivenName><FamilyName>Lindenstrauss</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap16" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>16</ChapterID><ChapterDOI>10.1007/3-540-60381-6_16</ChapterDOI><ChapterSequenceNumber>16</ChapterSequenceNumber><ChapterTitle Language="En">The complexity of testing ground reducibility for linear word rewriting systems with variables</ChapterTitle><ChapterFirstPage>262</ChapterFirstPage><ChapterLastPage>275</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1995</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>25</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540603816</BookID><BookTitle>Conditional and Typed Rewriting Systems</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Gregory</GivenName><FamilyName>Kucherov</FamilyName></AuthorName><Contact><Email>kucherov@1oria.fr</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Michaël</GivenName><FamilyName>Rusinowitch</FamilyName></AuthorName><Contact><Email>rusi@1oria.fr</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>INRIA-Lorraine and CRIN</OrgName><OrgAddress><Street>615, rue du Jardin Botanique</Street><Postbox>BP 101</Postbox><Postcode>54506</Postcode><City>Vandœuvre-lès-Nancy</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>In [9] we proved that for a word rewriting system with variables <InlineEquation ID="IE1"><InlineMediaObject><ImageObject FileRef="558_3540603816_Chapter_16_TeX2GIFIE1.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">
$$x\mathcal{R}$$
</EquationSource></InlineEquation> and a word with variables <Emphasis Type="Italic">Ω</Emphasis>, it is undecidable if <Emphasis Type="Italic">Ω</Emphasis> is ground reducible by <InlineEquation ID="IE2"><InlineMediaObject><ImageObject FileRef="558_3540603816_Chapter_16_TeX2GIFIE2.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">
$$x\mathcal{R}$$
</EquationSource></InlineEquation>, that is if all the instances of <Emphasis Type="Italic">Ω</Emphasis> obtained by substituting its variables by non-empty words are reducible by <InlineEquation ID="IE3"><InlineMediaObject><ImageObject FileRef="558_3540603816_Chapter_16_TeX2GIFIE3.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">
$$x\mathcal{R}$$
</EquationSource></InlineEquation>. On the other hand, if <InlineEquation ID="IE4"><InlineMediaObject><ImageObject FileRef="558_3540603816_Chapter_16_TeX2GIFIE4.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">
$$x\mathcal{R}$$
</EquationSource></InlineEquation> is linear, the question is decidable for arbitrary (linear or non-linear) <Emphasis Type="Italic">Ω</Emphasis>. In this paper we futher study the complexity of the above problem and prove that it is <Emphasis Type="Italic">co-NP</Emphasis>-complete if both <InlineEquation ID="IE5"><InlineMediaObject><ImageObject FileRef="558_3540603816_Chapter_16_TeX2GIFIE5.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">
$$x\mathcal{R}$$
</EquationSource></InlineEquation> and <Emphasis Type="Italic">Ω</Emphasis> are restricted to be linear. The proof is based on the construction of a deterministic finite automaton for the language of words reducible by <InlineEquation ID="IE6"><InlineMediaObject><ImageObject FileRef="558_3540603816_Chapter_16_TeX2GIFIE6.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">
$$x\mathcal{R}$$
</EquationSource></InlineEquation>. The construction generalizes the well-known Aho-Corasick automaton for string matching against a set of keywords.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>The complexity of testing ground reducibility for linear word rewriting systems with variables</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>The complexity of testing ground reducibility for linear word rewriting systems with variables</title></titleInfo><name type="personal"><namePart type="given">Gregory</namePart><namePart type="family">Kucherov</namePart><affiliation>INRIA-Lorraine and CRIN, 615, rue du Jardin Botanique, BP 101, 54506, Vandœuvre-lès-Nancy, France</affiliation><affiliation>E-mail: kucherov@1oria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Michaël</namePart><namePart type="family">Rusinowitch</namePart><affiliation>INRIA-Lorraine and CRIN, 615, rue du Jardin Botanique, BP 101, 54506, Vandœuvre-lès-Nancy, France</affiliation><affiliation>E-mail: rusi@1oria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="ReviewPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1995</dateIssued><copyrightDate encoding="w3cdtf">1995</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: In [9] we proved that for a word rewriting system with variables $$x\mathcal{R}$$ and a word with variables Ω, it is undecidable if Ω is ground reducible by $$x\mathcal{R}$$ , that is if all the instances of Ω obtained by substituting its variables by non-empty words are reducible by $$x\mathcal{R}$$ . On the other hand, if $$x\mathcal{R}$$ is linear, the question is decidable for arbitrary (linear or non-linear) Ω. In this paper we futher study the complexity of the above problem and prove that it is co-NP-complete if both $$x\mathcal{R}$$ and Ω are restricted to be linear. The proof is based on the construction of a deterministic finite automaton for the language of words reducible by $$x\mathcal{R}$$ . The construction generalizes the well-known Aho-Corasick automaton for string matching against a set of keywords.</abstract><relatedItem type="host"><titleInfo><title>Conditional and Typed Rewriting Systems</title><subTitle>4th International Workshop, CTRS-94 Jerusalem, Israel, July 13–15, 1994 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Nachum</namePart><namePart type="family">Dershowitz</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Naomi</namePart><namePart type="family">Lindenstrauss</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1995</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic></subject><identifier type="DOI">10.1007/3-540-60381-6</identifier><identifier type="ISBN">978-3-540-60381-8</identifier><identifier type="eISBN">978-3-540-45513-4</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">42637</identifier><identifier type="BookID">3540603816</identifier><identifier type="BookChapterCount">21</identifier><identifier type="BookVolumeNumber">968</identifier><part><date>1995</date><detail type="volume"><number>968</number><caption>vol.</caption></detail><extent unit="pages"><start>262</start><end>275</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1995</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1995</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1995</recordOrigin></recordInfo></relatedItem><identifier type="istex">FBA4E50079058BCCEE4BBF728E33F6DC3A91E82E</identifier><identifier type="ark">ark:/67375/HCB-RW443W7H-B</identifier><identifier type="DOI">10.1007/3-540-60381-6_16</identifier><identifier type="ChapterID">16</identifier><identifier type="ChapterID">Chap16</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1995</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag, 1995</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-RW443W7H-B/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003C39 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 003C39 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:FBA4E50079058BCCEE4BBF728E33F6DC3A91E82E
|texte= The complexity of testing ground reducibility for linear word rewriting systems with variables
}}
| This area was generated with Dilib version V0.6.33. |  |