Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be matched. Expressions in this extension describe the same languages as the usual regular expressions, but are exponentially more succinct. We define a class of finite automata with counters and a deterministic subclass of these. Deterministic finite automata with counters can recognize words in linear time. Furthermore, we describe a subclass of the regular expressions with numerical constraints, a polynomial-time test for this subclass, and a polynomial-time construction of deterministic finite automata with counters from expressions in the subclass. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Hovland, D. (2009). Regular expressions with numerical constraints and automata with counters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5684 LNCS, pp. 231–245). https://doi.org/10.1007/978-3-642-03466-4_15
Mendeley helps you to discover research relevant for your work.