Simplifying Regular Expressions
Identifieur interne : 001B23 ( Istex/Corpus ); précédent : 001B22; suivant : 001B24Simplifying Regular Expressions
Auteurs : Hermann Gruber ; Stefan GulanSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Abstract
Abstract: We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we propose a new normal form for regular expressions, which outperforms previous heuristics while still being computable in linear time. This allows us to determine an exact bound for the relation between the two prevalent measures for regular expression - size: alphabetic width and reverse polish notation length. In addition, we show that every regular expression of alphabetic width n can be converted into a nondeterministic finite automaton with ε-transitions of size at most $4\frac25n+1$ , and prove this bound to be optimal. This answers a question posed by Ilie and Yu, who had obtained lower and upper bounds of 4n − 1 and $9n-\frac12$ , respectively [15]. For reverse polish notation length as input size measure, an optimal bound was recently determined by Gulan and Fernau [14]. We prove that, under mild restrictions, their construction is also optimal when taking alphabetic width as input size measure.
Url:
DOI: 10.1007/978-3-642-13089-2_24
Links to Exploration step
ISTEX:5B91C3C5509159646E51DEC0F18941A4CC1B5D6DLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Simplifying Regular Expressions</title><author><name sortKey="Gruber, Hermann" sort="Gruber, Hermann" uniqKey="Gruber H" first="Hermann" last="Gruber">Hermann Gruber</name><affiliation><mods:affiliation>Institut für Informatik, Universität Gießen, Arndtstraße 2, D-35392, Gießen, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: hermann.gruber@informatik.uni-giessen.de</mods:affiliation></affiliation></author><author><name sortKey="Gulan, Stefan" sort="Gulan, Stefan" uniqKey="Gulan S" first="Stefan" last="Gulan">Stefan Gulan</name><affiliation><mods:affiliation>Fachbereich IV—Informatik, Universität Trier, Campus II, D-54296, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: gulan@uni-trier.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5B91C3C5509159646E51DEC0F18941A4CC1B5D6D</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-13089-2_24</idno><idno type="url">https://api.istex.fr/document/5B91C3C5509159646E51DEC0F18941A4CC1B5D6D/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001B23</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001B23</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Simplifying Regular Expressions</title><author><name sortKey="Gruber, Hermann" sort="Gruber, Hermann" uniqKey="Gruber H" first="Hermann" last="Gruber">Hermann Gruber</name><affiliation><mods:affiliation>Institut für Informatik, Universität Gießen, Arndtstraße 2, D-35392, Gießen, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: hermann.gruber@informatik.uni-giessen.de</mods:affiliation></affiliation></author><author><name sortKey="Gulan, Stefan" sort="Gulan, Stefan" uniqKey="Gulan S" first="Stefan" last="Gulan">Stefan Gulan</name><affiliation><mods:affiliation>Fachbereich IV—Informatik, Universität Trier, Campus II, D-54296, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: gulan@uni-trier.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2010</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">5B91C3C5509159646E51DEC0F18941A4CC1B5D6D</idno><idno type="DOI">10.1007/978-3-642-13089-2_24</idno><idno type="ChapterID">24</idno><idno type="ChapterID">Chap24</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we propose a new normal form for regular expressions, which outperforms previous heuristics while still being computable in linear time. This allows us to determine an exact bound for the relation between the two prevalent measures for regular expression - size: alphabetic width and reverse polish notation length. In addition, we show that every regular expression of alphabetic width n can be converted into a nondeterministic finite automaton with ε-transitions of size at most $4\frac25n+1$ , and prove this bound to be optimal. This answers a question posed by Ilie and Yu, who had obtained lower and upper bounds of 4n − 1 and $9n-\frac12$ , respectively [15]. For reverse polish notation length as input size measure, an optimal bound was recently determined by Gulan and Fernau [14]. We prove that, under mild restrictions, their construction is also optimal when taking alphabetic width as input size measure.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Hermann Gruber</name><affiliations><json:string>Institut für Informatik, Universität Gießen, Arndtstraße 2, D-35392, Gießen, Germany</json:string><json:string>E-mail: hermann.gruber@informatik.uni-giessen.de</json:string></affiliations></json:item><json:item><name>Stefan Gulan</name><affiliations><json:string>Fachbereich IV—Informatik, Universität Trier, Campus II, D-54296, Trier, Germany</json:string><json:string>E-mail: gulan@uni-trier.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we propose a new normal form for regular expressions, which outperforms previous heuristics while still being computable in linear time. This allows us to determine an exact bound for the relation between the two prevalent measures for regular expression - size: alphabetic width and reverse polish notation length. In addition, we show that every regular expression of alphabetic width n can be converted into a nondeterministic finite automaton with ε-transitions of size at most $4\frac25n+1$ , and prove this bound to be optimal. This answers a question posed by Ilie and Yu, who had obtained lower and upper bounds of 4n − 1 and $9n-\frac12$ , respectively [15]. For reverse polish notation length as input size measure, an optimal bound was recently determined by Gulan and Fernau [14]. We prove that, under mild restrictions, their construction is also optimal when taking alphabetic width as input size measure.</abstract><qualityIndicators><score>8.504</score><pdfVersion>1.6</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>1096</abstractCharCount><pdfWordCount>5361</pdfWordCount><pdfCharCount>26252</pdfCharCount><pdfPageCount>12</pdfPageCount><abstractWordCount>167</abstractWordCount></qualityIndicators><title>Simplifying Regular Expressions</title><chapterId><json:string>24</json:string><json:string>Chap24</json:string></chapterId><refBibs><json:item><author><json:item><name>L Aceto</name></json:item><json:item><name>W Fokkink</name></json:item><json:item><name>A Ingólfsdóttir</name></json:item></author><host><volume>209</volume><pages><last>178</last><first>163</first></pages><issue>1</issue><author></author><title>Theoretical Computer Science</title><publicationDate>1998</publicationDate></host><title>On a question of A. Salomaa: the equational theory of regular expressions over a singleton alphabet is not finitely axiomatizable</title><publicationDate>1998</publicationDate></json:item><json:item><host><author><json:item><name>F Baader</name></json:item><json:item><name>T Nipkow</name></json:item></author><title>Term Rewriting and All That</title><publicationDate>1998</publicationDate></host></json:item><json:item><author><json:item><name>P Bille</name></json:item><json:item><name>M Thorup</name></json:item></author><host><pages><last>182</last><first>171</first></pages><author></author><title>ICALP 2009</title><publicationDate>2009</publicationDate></host><title>Faster regular expression matching</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>A Brüggemann-Klein</name></json:item></author><host><volume>120</volume><pages><last>213</last><first>197</first></pages><issue>2</issue><author></author><title>Theoretical Computer Science</title><publicationDate>1993</publicationDate></host><title>Regular expressions into finite automata</title><publicationDate>1993</publicationDate></json:item><json:item><author><json:item><name>P Caron</name></json:item><json:item><name>J,M Champarnaud</name></json:item><json:item><name>L Mignot</name></json:item></author><host><pages><last>301</last><first>290</first></pages><author></author><title>LATA 2009</title><publicationDate>2009</publicationDate></host><title>Multi-tilde operators and their Glushkov automata</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>J,M Champarnaud</name></json:item><json:item><name>F Ouardi</name></json:item><json:item><name>D Ziadi</name></json:item></author><host><volume>17</volume><pages><last>154</last><first>141</first></pages><issue>1</issue><author></author><title>International Journal of Algebra and Computation</title><publicationDate>2007</publicationDate></host><title>Normalized expressions and finite automata</title><publicationDate>2007</publicationDate></json:item><json:item><author><json:item><name>J,H Conway</name></json:item></author><host><author></author><title>Boca Raton</title><publicationDate>1971</publicationDate></host><title>Regular Algebra and Finite Machines</title><publicationDate>1971</publicationDate></json:item><json:item><author><json:item><name>K Ellul</name></json:item><json:item><name>B Krawetz</name></json:item><json:item><name>J Shallit</name></json:item><json:item><name>M Wang</name></json:item></author><host><volume>10</volume><pages><last>437</last><first>407</first></pages><issue>4</issue><author></author><title>Journal of Automata, Languages and Combinatorics</title><publicationDate>2005</publicationDate></host><title>Regular expressions: New results and open problems</title><publicationDate>2005</publicationDate></json:item><json:item><author><json:item><name>M Frishert</name></json:item><json:item><name>L,G Cleophas</name></json:item><json:item><name>B,W Watson</name></json:item></author><host><pages><last>305</last><first>304</first></pages><author></author><title>CIAA 2003</title><publicationDate>2003</publicationDate></host><title>The effect of rewriting regular expression on their accepting automata</title><publicationDate>2003</publicationDate></json:item><json:item><author><json:item><name>W Gelade</name></json:item><json:item><name>W Martens</name></json:item><json:item><name>F Neven</name></json:item></author><host><volume>38</volume><pages><last>2043</last><first>2021</first></pages><issue>5</issue><author></author><title>SIAM Journal on Computing</title><publicationDate>2009</publicationDate></host><title>Optimizing schema languages for XML: Numerical constraints and interleaving</title><publicationDate>2009</publicationDate></json:item><json:item><author><json:item><name>W Gelade</name></json:item><json:item><name>F Neven</name></json:item></author><host><pages><last>336</last><first>325</first></pages><author></author><title>Symposium on Theoretical Aspects of Computer Science. Number 08001 in Dagstuhl Seminar Proceedings</title><publicationDate>2008</publicationDate></host><title>Succinctness of the complement and intersection of regular expressions</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>H Gruber</name></json:item><json:item><name>M Holzer</name></json:item><json:item><name>L Aceto</name></json:item><json:item><name>I Damgård</name></json:item><json:item><name>L,A Goldberg</name></json:item><json:item><name>M,M Halldórsson</name></json:item><json:item><name>A Ingólfsdóttir</name></json:item></author><host><pages><last>50</last><first>39</first></pages><author></author><title>Part II</title><publicationDate>2008</publicationDate></host><title>Finite automata, digraph connectivity, and regular expression size</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>H Gruber</name></json:item><json:item><name>J Johannsen</name></json:item></author><host><pages><last>286</last><first>273</first></pages><author></author><title>FOSSACS 2008</title><publicationDate>2008</publicationDate></host><title>Optimal lower bounds on regular expression size using communication complexity</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>S Gulan</name></json:item><json:item><name>H Fernau</name></json:item></author><host><pages><last>222</last><first>211</first></pages><author></author><title>FSTTCS 2008. Number 08004 in Dagstuhl Seminar Proceedings</title><publicationDate>2008</publicationDate></host><title>An optimal construction of finite automata from regular expressions</title><publicationDate>2008</publicationDate></json:item><json:item><author><json:item><name>L Ilie</name></json:item><json:item><name>S Yu</name></json:item></author><host><volume>186</volume><pages><last>162</last><first>140</first></pages><issue>1</issue><author></author><title>Information and Computation</title><publicationDate>2003</publicationDate></host><title>Follow automata</title><publicationDate>2003</publicationDate></json:item><json:item><author><json:item><name>J Lee</name></json:item><json:item><name>J Shallit</name></json:item></author><host><pages><last>22</last><first>2</first></pages><author></author><title>CIAA 2004</title><publicationDate>2005</publicationDate></host><title>Enumerating regular expressions and their languages</title><publicationDate>2005</publicationDate></json:item><json:item><host><pages><last>129</last><first>125</first></pages><author><json:item><name>A,R Meyer</name></json:item><json:item><name>L,J Stockmeyer</name></json:item></author><title>The equivalence problem for regular expressions with squaring requires exponential space</title><publicationDate>1972</publicationDate></host></json:item><json:item><author><json:item><name>M Newman</name></json:item></author><host><volume>43</volume><pages><last>243</last><first>223</first></pages><issue>2</issue><author></author><title>Annals of Mathematics</title><publicationDate>1942</publicationDate></host><title>On theories with a combinatorial definition of</title><publicationDate>1942</publicationDate></json:item><json:item><author><json:item><name>K Thompson</name></json:item></author><host><volume>11</volume><pages><last>422</last><first>419</first></pages><issue>6</issue><author></author><title>Communications of the ACM</title><publicationDate>1968</publicationDate></host><title>Regular expression search algorithm</title><publicationDate>1968</publicationDate></json:item><json:item><host><author><json:item><name>D Wood</name></json:item></author><title>Theory of Computation</title><publicationDate>1987</publicationDate></host></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2010</copyrightDate></serie><host><editor><json:item><name>Adrian-Horia Dediu</name><affiliations><json:string>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</json:string><json:string>E-mail: adrian.dediu@urv.cat</json:string></affiliations></json:item><json:item><name>Henning Fernau</name><affiliations><json:string>Fachbereich IV - Informatik, Universität Trier, Campus II, Behringstraße, 54286, Trier, Germany</json:string><json:string>E-mail: fernau@informatik.uni-trier.de</json:string></affiliations></json:item><json:item><name>Carlos Martín-Vide</name><affiliations><json:string>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</json:string><json:string>E-mail: cmv@astor.urv.es</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Pattern Recognition</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item></subject><isbn><json:string>978-3-642-13088-5</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Language and Automata Theory and Applications</title><bookId><json:string>978-3-642-13089-2</json:string></bookId><volume>6031</volume><pages><last>296</last><first>285</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-13089-2</json:string></eisbn><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-13089-2</json:string></doi></host><publicationDate>2010</publicationDate><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-13089-2_24</json:string></doi><id>5B91C3C5509159646E51DEC0F18941A4CC1B5D6D</id><score>0.39098498</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/5B91C3C5509159646E51DEC0F18941A4CC1B5D6D/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/5B91C3C5509159646E51DEC0F18941A4CC1B5D6D/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/5B91C3C5509159646E51DEC0F18941A4CC1B5D6D/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Simplifying Regular Expressions</title><title level="a" type="sub" xml:lang="en">A Quantitative Perspective</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2010</p></availability><date>2010</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Simplifying Regular Expressions</title><title level="a" type="sub" xml:lang="en">A Quantitative Perspective</title><author xml:id="author-1"><persName><forename type="first">Hermann</forename><surname>Gruber</surname></persName><email>hermann.gruber@informatik.uni-giessen.de</email><affiliation>Institut für Informatik, Universität Gießen, Arndtstraße 2, D-35392, Gießen, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Stefan</forename><surname>Gulan</surname></persName><email>gulan@uni-trier.de</email><affiliation>Fachbereich IV—Informatik, Universität Trier, Campus II, D-54296, Trier, Germany</affiliation></author></analytic><monogr><title level="m">Language and Automata Theory and Applications</title><title level="m" type="sub">4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings</title><idno type="pISBN">978-3-642-13088-5</idno><idno type="eISBN">978-3-642-13089-2</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-13089-2</idno><idno type="book-ID">978-3-642-13089-2</idno><idno type="book-title-ID">211346</idno><idno type="book-sequence-number">6031</idno><idno type="book-volume-number">6031</idno><idno type="book-chapter-count">51</idno><editor><persName><forename type="first">Adrian-Horia</forename><surname>Dediu</surname></persName><email>adrian.dediu@urv.cat</email><affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</affiliation></editor><editor><persName><forename type="first">Henning</forename><surname>Fernau</surname></persName><email>fernau@informatik.uni-trier.de</email><affiliation>Fachbereich IV - Informatik, Universität Trier, Campus II, Behringstraße, 54286, Trier, Germany</affiliation></editor><editor><persName><forename type="first">Carlos</forename><surname>Martín-Vide</surname></persName><email>cmv@astor.urv.es</email><affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2010"></date><biblScope unit="volume">6031</biblScope><biblScope unit="page" from="285">285</biblScope><biblScope unit="page" to="296">296</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2010</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">5B91C3C5509159646E51DEC0F18941A4CC1B5D6D</idno><idno type="DOI">10.1007/978-3-642-13089-2_24</idno><idno type="ChapterID">24</idno><idno type="ChapterID">Chap24</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2010</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we propose a new normal form for regular expressions, which outperforms previous heuristics while still being computable in linear time. This allows us to determine an exact bound for the relation between the two prevalent measures for regular expression - size: alphabetic width and reverse polish notation length. In addition, we show that every regular expression of alphabetic width n can be converted into a nondeterministic finite automaton with ε-transitions of size at most $4\frac25n+1$ , and prove this bound to be optimal. This answers a question posed by Ilie and Yu, who had obtained lower and upper bounds of 4n − 1 and $9n-\frac12$ , respectively [15]. For reverse polish notation length as input size measure, an optimal bound was recently determined by Gulan and Fernau [14]. We prove that, under mild restrictions, their construction is also optimal when taking alphabetic width as input size measure.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16013</label><label>I16021</label><label>I21017</label><label>I16048</label><label>I2203X</label><label>I1603X</label><item><term>Computer Science</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Pattern Recognition</term></item><item><term>Logics and Meanings of Programs</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2010">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/5B91C3C5509159646E51DEC0F18941A4CC1B5D6D/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher 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 SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-13089-2</BookID><BookTitle>Language and Automata Theory and Applications</BookTitle><BookSubTitle>4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings</BookSubTitle><BookVolumeNumber>6031</BookVolumeNumber><BookSequenceNumber>6031</BookSequenceNumber><BookDOI>10.1007/978-3-642-13089-2</BookDOI><BookTitleID>211346</BookTitleID><BookPrintISBN>978-3-642-13088-5</BookPrintISBN><BookElectronicISBN>978-3-642-13089-2</BookElectronicISBN><BookChapterCount>51</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I16021" Priority="2" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I21017" Priority="3" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I16048" Priority="4" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I2203X" Priority="5" Type="Secondary">Pattern Recognition</BookSubject><BookSubject Code="I1603X" Priority="6" Type="Secondary">Logics and Meanings of Programs</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Adrian-Horia</GivenName><FamilyName>Dediu</FamilyName></EditorName><Contact><Email>adrian.dediu@urv.cat</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Henning</GivenName><FamilyName>Fernau</FamilyName></EditorName><Contact><Email>fernau@informatik.uni-trier.de</Email></Contact></Editor><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Carlos</GivenName><FamilyName>Martín-Vide</FamilyName></EditorName><Contact><Email>cmv@astor.urv.es</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Research Group on Mathematical Linguistics</OrgDivision><OrgName>Universitat Rovira i Virgili</OrgName><OrgAddress><Street>Avinguda Catalunya, 35</Street><Postcode>43002</Postcode><City>Tarragona</City><Country>Spain</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgDivision>Fachbereich IV - Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Street>Campus II, Behringstraße</Street><Postcode>54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID><PartSequenceNumber>2</PartSequenceNumber><PartTitle>Regular Papers</PartTitle><PartChapterCount>47</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Language and Automata Theory and Applications</BookTitle></PartContext></PartInfo><Chapter ID="Chap24" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>24</ChapterID><ChapterDOI>10.1007/978-3-642-13089-2_24</ChapterDOI><ChapterSequenceNumber>24</ChapterSequenceNumber><ChapterTitle Language="En">Simplifying Regular Expressions</ChapterTitle><ChapterSubTitle Language="En">A Quantitative Perspective</ChapterSubTitle><ChapterFirstPage>285</ChapterFirstPage><ChapterLastPage>296</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></ChapterCopyright><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><PartID>2</PartID><BookID>978-3-642-13089-2</BookID><BookTitle>Language and Automata Theory and Applications</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Hermann</GivenName><FamilyName>Gruber</FamilyName></AuthorName><Contact><Email>hermann.gruber@informatik.uni-giessen.de</Email></Contact></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Stefan</GivenName><FamilyName>Gulan</FamilyName></AuthorName><Contact><Email>gulan@uni-trier.de</Email></Contact></Author><Affiliation ID="Aff18"><OrgDivision>Institut für Informatik</OrgDivision><OrgName>Universität Gießen</OrgName><OrgAddress><Street>Arndtstraße 2</Street><Postcode>D-35392</Postcode><City>Gießen</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgDivision>Fachbereich IV—Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Street>Campus II</Street><Postcode>D-54296</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we propose a new normal form for regular expressions, which outperforms previous heuristics while still being computable in linear time. This allows us to determine an exact bound for the relation between the two prevalent measures for regular expression - size: alphabetic width and reverse polish notation length. In addition, we show that every regular expression of alphabetic width <Emphasis Type="Italic">n</Emphasis> can be converted into a nondeterministic finite automaton with <Emphasis Type="Italic">ε</Emphasis>-transitions of size at most <InlineEquation ID="IEq1"><InlineMediaObject><ImageObject FileRef="978-3-642-13089-2_24_Chapter_TeX2GIFIEq1.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">$4\frac25n+1$</EquationSource></InlineEquation>, and prove this bound to be optimal. This answers a question posed by Ilie and Yu, who had obtained lower and upper bounds of 4<Emphasis Type="Italic">n</Emphasis> − 1 and <InlineEquation ID="IEq2"><InlineMediaObject><ImageObject FileRef="978-3-642-13089-2_24_Chapter_TeX2GIFIEq2.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject></InlineMediaObject><EquationSource Format="TEX">$9n-\frac12$</EquationSource></InlineEquation>, respectively [15]. For reverse polish notation length as input size measure, an optimal bound was recently determined by Gulan and Fernau [14]. We prove that, under mild restrictions, their construction is also optimal when taking alphabetic width as input size measure.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Simplifying Regular Expressions</title><subTitle>A Quantitative Perspective</subTitle></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Simplifying Regular Expressions</title><subTitle>A Quantitative Perspective</subTitle></titleInfo><name type="personal"><namePart type="given">Hermann</namePart><namePart type="family">Gruber</namePart><affiliation>Institut für Informatik, Universität Gießen, Arndtstraße 2, D-35392, Gießen, Germany</affiliation><affiliation>E-mail: hermann.gruber@informatik.uni-giessen.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Stefan</namePart><namePart type="family">Gulan</namePart><affiliation>Fachbereich IV—Informatik, Universität Trier, Campus II, D-54296, Trier, Germany</affiliation><affiliation>E-mail: gulan@uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2010</dateIssued><copyrightDate encoding="w3cdtf">2010</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we propose a new normal form for regular expressions, which outperforms previous heuristics while still being computable in linear time. This allows us to determine an exact bound for the relation between the two prevalent measures for regular expression - size: alphabetic width and reverse polish notation length. In addition, we show that every regular expression of alphabetic width n can be converted into a nondeterministic finite automaton with ε-transitions of size at most $4\frac25n+1$ , and prove this bound to be optimal. This answers a question posed by Ilie and Yu, who had obtained lower and upper bounds of 4n − 1 and $9n-\frac12$ , respectively [15]. For reverse polish notation length as input size measure, an optimal bound was recently determined by Gulan and Fernau [14]. We prove that, under mild restrictions, their construction is also optimal when taking alphabetic width as input size measure.</abstract><relatedItem type="host"><titleInfo><title>Language and Automata Theory and Applications</title><subTitle>4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Adrian-Horia</namePart><namePart type="family">Dediu</namePart><affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</affiliation><affiliation>E-mail: adrian.dediu@urv.cat</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Henning</namePart><namePart type="family">Fernau</namePart><affiliation>Fachbereich IV - Informatik, Universität Trier, Campus II, Behringstraße, 54286, Trier, Germany</affiliation><affiliation>E-mail: fernau@informatik.uni-trier.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Carlos</namePart><namePart type="family">Martín-Vide</namePart><affiliation>Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain</affiliation><affiliation>E-mail: cmv@astor.urv.es</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2010</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="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I2203X">Pattern Recognition</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic></subject><identifier type="DOI">10.1007/978-3-642-13089-2</identifier><identifier type="ISBN">978-3-642-13088-5</identifier><identifier type="eISBN">978-3-642-13089-2</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">211346</identifier><identifier type="BookID">978-3-642-13089-2</identifier><identifier type="BookChapterCount">51</identifier><identifier type="BookVolumeNumber">6031</identifier><identifier type="BookSequenceNumber">6031</identifier><identifier type="PartChapterCount">47</identifier><part><date>2010</date><detail type="part"><title>Regular Papers</title></detail><detail type="volume"><number>6031</number><caption>vol.</caption></detail><extent unit="pages"><start>285</start><end>296</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2010</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 Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><identifier type="istex">5B91C3C5509159646E51DEC0F18941A4CC1B5D6D</identifier><identifier type="DOI">10.1007/978-3-642-13089-2_24</identifier><identifier type="ChapterID">24</identifier><identifier type="ChapterID">Chap24</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2010</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001B23 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001B23 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:5B91C3C5509159646E51DEC0F18941A4CC1B5D6D
|texte= Simplifying Regular Expressions
}}
| This area was generated with Dilib version V0.6.31. |  |