|
|
|
|
|
Fahad M. Alotaibi and Vassilios G. Vassilakis
Web attacks pose a significant threat to enterprises, as attackers often target web applications first. Various solutions have been proposed to mitigate and reduce the severity of these threats, such as web application firewalls (WAFs). On the other hand...
ver más
|
|
|
|
|
|
|
|
|
|
|
S.V. Kozlov,A. V. Svetlakov
Pág. 82 - 89
This article describes the use of regular expressions in solving syntactic and lexical analysis problems. The concept of a regular expression is given, its essence is briefly described. The authors set three main tasks of using regular expressions in sof...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alexander Prutzkow,Irina Susanina
Pág. 63 - 68
In a bibliometric analysis of publications by Russian authors in the field of art therapy based on the library database of the Scientific Electronic Library, as well as the Russian State Library for the period from 2005 to 2021 we to solve a problem of t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Faissal Ouardi, Zineb Lotfi and Bilal Elghadyry
This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression. Allauzen and Mohri have presented a unified construction of small automata and gave a cons...
ver más
|
|
|
|
|
|
|
|
|
|
|
Daniel Gibney and Sharma V. Thankachan
Finding substrings of a text T that match a regular expression p is a fundamental problem. Despite being the subject of extensive research, no solution with a time complexity significantly better than ??(|??||??|)
O
(
|
T
|
|
p
|
)
has been found. Backu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Joachim Niehren and Momar Sakho
We consider the problem of determinizing and minimizing automata for nested words in practice. For this we compile the nested regular expressions (????????
NREs
) from the usual XPath benchmark to nested word automata (????????
NWAs
). The determinizatio...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mate Baric, David Brcic, Mate Kosor and Roko Jelic
Based on traditional expressions and spherical trigonometry, at present, great circle navigation is undertaken using various navigational software packages. Recent research has mainly focused on vector algebra. These problems are calculated numerically a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Coenrad de Jager and Marinda Nel
Companies are relying more on artificial intelligence and machine learning in order to enhance and automate existing business processes. While the power of OCR (Optical Character Recognition) technologies can be harnessed for the digitization of image da...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 8
In this paper, we introduce a new formalism which is intended for representing a special extensions of finite automata. We call them generalized nondeterministic finite pseudo-automata. This formalism gives not only the equivalence be...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 5
The paper is related to the star-height for nondeterministic finite automata, not for the star-height problem for regular languages. We describe an alternative proof of Kleene?s theorem, and then our version of the reduction of some p...
ver más
|
|
|
|
|
|