Efficient POSIX submatch extraction on nondeterministic finite automata-Reference-Cited by-同舟云学术

Efficient POSIX submatch extraction on nondeterministic finite automata

Published:2020-10-18 Issue:2 Volume:51 Page:159-192
ISSN:0038-0644
Container-title:Software: Practice and Experience
language:en
Short-container-title:Softw Pract Exper

Author:

Borsotti Angelo¹,Trofimovich Ulya²^ORCID

Affiliation:

1. Department of Electronics, Information and Bioengineering Polytechnic University of Milan Milan Italy

2. Department of Discrete Mathematics and Algorithmics Belarusian State University Minsk Belarus

Publisher

Wiley

Subject

Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/spe.2881

Reference22 articles.

1. Programming techniques: regular expression search algorithm;Ken T;Commun ACM,1968

2. OkuiS SuzukiT. Disambiguation in regular expression matching via position automata with augmented transitions. Paper presented at: Proceedings of the International Conference on Implementation and Application of Automata;2013:231‐240; Springer Berlin Heidelberg/Germany.

3. KuklewiczC. Regular expressions/bounded space proposal;2007.http://wiki.haskell.org/index.php?title=Regular_expressions/Bounded_space_proposal&oldid=11475. Accessed September 5 2020.

4. CoxR. backward POSIX matching algorithm (source code);2009.https://swtch.com/∼rsc/regexp/nfa‐posix.y.txt. Accessed September 5 2020.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Static Analysis for Checking the Disambiguation Robustness of Regular Expressions;Proceedings of the ACM on Programming Languages;2024-06-20

2. Linear Matching of JavaScript Regular Expressions;Proceedings of the ACM on Programming Languages;2024-06-20

3. Using expression parsing and algebraic operations to generate test sequences.;Journal of Systems and Software;2023-10