|
Intelligent systems. Theory and applications, 2021, Volume 25, Issue 4, Pages 53–57
(Mi ista415)
|
|
|
|
Part 2. Mathematics and Computer Science
Practical estimates of the complexity of regular expressions
D. E. Alexandrov, A. V. Krasnenkova Lomonosov Moscow State University
Abstract:
This paper describes a series of experiments on finite automata and identifies classes of potentially simple and potentially complex regular expressions leading to an exponential explosion in the number of states.
Keywords:
finite automata, regular expressions, exponential explosion, computational experiments.
Citation:
D. E. Alexandrov, A. V. Krasnenkova, “Practical estimates of the complexity of regular expressions”, Intelligent systems. Theory and applications, 25:4 (2021), 53–57
Linking options:
https://www.mathnet.ru/eng/ista415 https://www.mathnet.ru/eng/ista/v25/i4/p53
|
Statistics & downloads: |
Abstract page: | 75 | Full-text PDF : | 166 | References: | 16 |
|