Prefix-free regular languages and pattern matching

DOI10.1016/j.tcs.2007.10.017zbMath1143.68037OpenAlexW2170160673MaRDI QIDQ2465647

Yanyan Li

Publication date: 7 January 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.017

zbMATH Keywords

prefix-free regular languagesstring pattern matchingpruned prefix-free languagesregular-expression matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Generalizations of Code Languages with Marginal Errors ⋮ Decidability of involution hypercodes ⋮ A faster algorithm for finding shortest substring matches of a regular expression ⋮ AN IMPROVED PREFIX-FREE REGULAR-EXPRESSION MATCHING ⋮ Generalizations of Code Languages with Marginal Errors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic generalized automata
• A fast string searching algorithm
• Efficient string matching
• Fast Pattern Matching in Strings
• THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
• Programming Techniques: Regular expression search algorithm

This page was built for publication: Prefix-free regular languages and pattern matching