An automata-based recognition algorithm for semi-extended regular expressions

DOI10.1007/3-540-44612-5_65MaRDI QIDQ4536406zbMATH OpenFDO

Authors Hiroaki Yamamoto

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44612-5_65

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2080996
• Fast algorithms for extended regular expression matching and searching
• An improved algorithm for the membership problem for extended regular expressions
• scientific article; zbMATH DE number 5717242
• A fast bit-parallel algorithm for matching extended regular expressions

Cited in

(7)

• Conjunctive grammars and alternating pushdown automata
• scientific article; zbMATH DE number 5903158 (Why is no real title available?)
• scientific article; zbMATH DE number 5717242 (Why is no real title available?)
• scientific article; zbMATH DE number 2080996 (Why is no real title available?)
• An improved algorithm for the membership problem for extended regular expressions
• Algorithms and Computation
• Embedding finite automata within regular expressions

This page was built for publication: An automata-based recognition algorithm for semi-extended regular expressions

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