An improved prefix-free regular-expression matching

DOI10.1142/S0129054113500238MaRDI QIDQ5404517zbMATH OpenFDO

Authors Yo-Sub Han

Publication date 24 March 2014

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054113500238

zbMATH Keywords

prefix-free regular expressionsregular-expression matchingstring pattern matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• Combinatorial Pattern Matching
• Prefix-free regular languages and pattern matching
• Faster Regular Expression Matching
• New Algorithms for Regular Expression Matching
• Fast and compact regular expression matching

Cites work

• A fast string searching algorithm
• Efficient string matching
• Fast Pattern Matching in Strings
• Prefix-free regular languages and pattern matching
• Programming Techniques: Regular expression search algorithm

Cited in

(6)

• Prefix-free regular languages and pattern matching
• Generalizations of code languages with marginal errors
• Negative factor. Improving regular-expression matching in strings
• Fundamentals of Computation Theory
• Combinatorial Pattern Matching
• Generalizations of Code Languages with Marginal Errors

This page was built for publication: An improved prefix-free regular-expression matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404517)