Skip to main content
SpringerLink
Log in

Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions

  • Conference paper
Implementation and Application of Automata (CIAA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6482))

Included in the following conference series:

Abstract

This paper offers a new efficient regular expression matching algorithm which follows the POSIX-type leftmost-longest rule. The algorithm basically emulates the subset construction without backtracking, so that its computational cost even in the worst case does not explode exponentially; the time complexity of the algorithm is O(mn(n + c)), where m is the length of a given input string, n the number of occurrences of the most frequently used letter in a given regular expression and c the number of subexpressions to be used for capturing substrings. A formalization of the leftmost-longest semantics by using parse trees is also discussed.

This work is supported by Japan Society for Promotion of Science, Basic Research (C) No.22500019.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The Open Group Base Specification Issue 6 IEEE Std 1003.1 2004 Edition (2004), http://www.opengroup.org/onlinepubs/009695399/basedefs/xbd_chap09.html

  2. Cox, R.: Regular Expression Matching Can Be Simple and Fast (2007), http://swtch.com/~rsc/regexp/regexp1.html

  3. Cox, R.: Regular Expression Matching in the Wild (2010), http://swtch.com/~rsc/regexp/regexp3.html

  4. Dubé, D., Feeley, M.: Efficiently Building a Parse Tree from a Regular Expression. Acta Infomatica 37(2), 121–144 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fowler, G.: An Iterpretation of the POSIX Regex Standard (2003), http://www2.research.att.com/~gsf/testregex/re-interpretation.html

  6. Frisch, A., Cardelli, L.: Greedy Regular Expression Matching. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 618–629. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Glushkov, V.M.: The Abstract Theory of Automata. Russian Mathematical Surveys 16(5), 1–53 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kuklewicz, C.: Regular Expressions: Bounded Space Proposal (2007), http://www.haskell.org/haskellwiki/Regular_expressions/Bounded_space_proposal

  9. Laurikari, V.: Efficient Submatch Addressing for Regular Expressions. Master’s thesis, Helsinki University of Technology (2001)

    Google Scholar 

  10. McNaughton, R., Yamada, H.: Regular Expressions and State Graphs for Automata. IEEE Transactions on Electronic Computers 9, 39–47 (1960)

    Article  MATH  Google Scholar 

  11. Vansummeren, S.: Type Inference for Unique Pattern Matching. ACM Transactions on Programming Languages and Systems 28(3), 389–428 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Chubu University, Japan

    Satoshi Okui

  2. School of Computer Science and Engineering, The University of Aizu, Japan

    Taro Suzuki

Authors
  1. Satoshi Okui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Taro Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Okui, S., Suzuki, T. (2011). Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18098-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18097-2

  • Online ISBN: 978-3-642-18098-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation