We give characterizations of strong determinism for regular expressions with counting, based on which we present an O(|Σ E∥E|) time algorithm to check whether an expression E with counting is strongly deterministic where Σ E is the set of distinct symbols in E. It improves the previous upper bound of O(|E| 3) time on the same decision problems for both standard regular expressions and regular expressions with counting. As a natural result of our work we derive a characterization of weak determinism for regular expressions with counting, which leads to a new O(|Σ E∥E|) time algorithm for deciding weak determinism of regular expressions with counting. © 2012 Springer-Verlag.
CITATION STYLE
Chen, H., & Lu, P. (2012). Checking determinism of regular expressions with counting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7410 LNCS, pp. 332–343). https://doi.org/10.1007/978-3-642-31653-1_30
Mendeley helps you to discover research relevant for your work.