Authors
Kovalev A.
|
Degree
|
Student, Department of System Modeling and Engineering Graphics, Moscow Aviation Institute (National Research University) |
|---|---|
|
Location
|
Moscow |
|
Articles
|
Regular expression cardinality (size) calculation as optimality criterion in URL routingThe article is devoted to the subject of finite automata theory and regular expressions. It has practical
and theoretical issues. The theoretical issue considers a calculation of cardinality (size) of regular
expression. The main problem is in the redundant parts of regular expressions. We are considering
their simplification. This process splits into two parts: redundancy removing, finite condition adding.
Finite condition introduced to remove uncertainty and allows calculate exact number of all combinations.
In case of complex regular expressions the intersection of patterns appeared. The most difficult
problem is to calculate cardinality with that intersection. Authors propose to avoid using of complex
regular expressions with intersections. The parameter of cardinality will be used in practical part as
optimality criterion. The practical issue operates with objects identified by pattern and input string on
the other side. Input string represents user-defined URL and objects represented by dynamic Web-page
with variable parts. Each variable of the input data involved in behavior of the web-server in data selection.
The main thesis proposed by authors in assignment of priority to the ambiguous patterns. The
pattern with the lowest cardinality will be the most suitable. The solution should help to route URLs
in classical developing methods.
Read more...
|
