View in EDS PDF Full Text

Derivatives of Approximate Regular Expressions.

Saved in:
Bibliographic Details
Title: Derivatives of Approximate Regular Expressions.
Authors: Champarnaud, J.-M.1 jean-marc.champarnaud@univ-rouen.fr, Jeanne, H.1 hadrien.jeanne@univ-rouen.fr, Mignot, L.1 ludovic.mignot@univ-rouen.fr
Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2013, Vol. 15 Issue 2, p95-120. 26p. 4 Diagrams.
Subjects: Sequential machine theory, Bounded arithmetics, Operator theory, Derivatives (Mathematics), Algorithms
Abstract: Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the notion of distance and we introduce the family of regular expressions extended to similarity operators, that we call AREs (Approximate Regular Expressions). We set formulae to compute the Brzozowski derivatives and the Antimirov derivatives of an ARE, which allows us to give a solution to the ARE membership problem and to provide the construction of two recognizers for the language denoted by an ARE. As far as we know, the family of approximative regular expressions is introduced for the first time in this paper. Classical approximate regular expression matching algorithms are approximate matching algorithms on regular expressions. Our approach is rather to process an exact matching on approximate regular expressions. [ABSTRACT FROM AUTHOR]
Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 90175534
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Derivatives of Approximate Regular Expressions.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Champarnaud%2C+J%2E-M%2E%22">Champarnaud, J.-M.</searchLink><relatesTo>1</relatesTo><i> jean-marc.champarnaud@univ-rouen.fr</i><br /><searchLink fieldCode="AR" term="%22Jeanne%2C+H%2E%22">Jeanne, H.</searchLink><relatesTo>1</relatesTo><i> hadrien.jeanne@univ-rouen.fr</i><br /><searchLink fieldCode="AR" term="%22Mignot%2C+L%2E%22">Mignot, L.</searchLink><relatesTo>1</relatesTo><i> ludovic.mignot@univ-rouen.fr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Mathematics+%26+Theoretical+Computer+Science+%28DMTCS%29%22">Discrete Mathematics & Theoretical Computer Science (DMTCS)</searchLink>. 2013, Vol. 15 Issue 2, p95-120. 26p. 4 Diagrams.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Sequential+machine+theory%22">Sequential machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Bounded+arithmetics%22">Bounded arithmetics</searchLink><br /><searchLink fieldCode="DE" term="%22Operator+theory%22">Operator theory</searchLink><br /><searchLink fieldCode="DE" term="%22Derivatives+%28Mathematics%29%22">Derivatives (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the notion of distance and we introduce the family of regular expressions extended to similarity operators, that we call AREs (Approximate Regular Expressions). We set formulae to compute the Brzozowski derivatives and the Antimirov derivatives of an ARE, which allows us to give a solution to the ARE membership problem and to provide the construction of two recognizers for the language denoted by an ARE. As far as we know, the family of approximative regular expressions is introduced for the first time in this paper. Classical approximate regular expression matching algorithms are approximate matching algorithms on regular expressions. Our approach is rather to process an exact matching on approximate regular expressions. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=90175534
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 26
        StartPage: 95
    Subjects:
      – SubjectFull: Sequential machine theory
        Type: general
      – SubjectFull: Bounded arithmetics
        Type: general
      – SubjectFull: Operator theory
        Type: general
      – SubjectFull: Derivatives (Mathematics)
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Derivatives of Approximate Regular Expressions.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Champarnaud, J.-M.
      – PersonEntity:
          Name:
            NameFull: Jeanne, H.
      – PersonEntity:
          Name:
            NameFull: Mignot, L.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: 2013
              Type: published
              Y: 2013
          Identifiers:
            – Type: issn-print
              Value: 13658050
          Numbering:
            – Type: volume
              Value: 15
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Discrete Mathematics & Theoretical Computer Science (DMTCS)
              Type: main
ResultId 1