Cardinality estimates for some classes of regular languages
-
Dmitriy E. Alexandrov
Abstract
We consider a method that modifies regular expressions in order to solve the “exponential explosion” problem on the number of states of the finite automaton that recognizes a set of regular languages defined by the union of regular expressions of the form .∗ R1.∗ R2.∗, where R1 and R2 are arbitrary regular expressions. We estimate the growth functions of regular languages from a subclass of the described class of regular languages and propose a method for estimation of relative growth of the number of words for the modification of a language defined by a pair of regular expressions.We also analyse practical eficiency of the proposed modification method and estimation method for the case of regular expressions from the system Snort.
© 2015 by Walter de Gruyter Berlin/Boston
Artikel in diesem Heft
- Frontmatter
- Cardinality estimates for some classes of regular languages
- On large deviations of a branching process in random environments with immigration at moments of extinction
- Existence of arbitrarily long square-free words with one possible mismatch
- On frequencies of elements in multicyclic random sequence modulo 4
- Single tests for logical gates
- On the probability of coincidence of cycle lengths for independent random permutations with given number of cycles
Artikel in diesem Heft
- Frontmatter
- Cardinality estimates for some classes of regular languages
- On large deviations of a branching process in random environments with immigration at moments of extinction
- Existence of arbitrarily long square-free words with one possible mismatch
- On frequencies of elements in multicyclic random sequence modulo 4
- Single tests for logical gates
- On the probability of coincidence of cycle lengths for independent random permutations with given number of cycles
