Results 11 to 20 of about 551,541 (325)
Effective Filter for Common Injection Attacks in Online Web Applications
IEEE Access, 2021 Injection attacks against web applications are still frequent, and organizations like OWASP places them within the Top Ten of security risks to web applications. The main goal of this work is to contribute to the community with the design of an effective
Santiago Ibarra-Fiallos +5 more
doaj +1 more source
HEDEA: A Python Tool for Extracting and Analysing Semi-structured Information from Medical Records [PDF]
Healthcare Informatics Research, 2018 ObjectivesOne of the most important functions for a medical practitioner while treating a patient is to study the patient's complete medical history by going through all records, from test results to doctor's notes.
Anshul Aggarwal +2 more
doaj +1 more source
Synchronized Regular Expressions [PDF]
Electronic Notes in Theoretical Computer Science, 2002 Abstract Text manipulation is one of the most common tasks for everyone using a computer. The increasing number of textual information in electronic format that every computer user collects everyday stresses the need of more powerful tools to interact with texts.
DELLA PENNA, GIUSEPPE +3 more
openaire +5 more sources
Regular transducer expressions for regular transformations [PDF]
Information and Computation, 2018 Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent models for regular functions. In this paper, we show that every regular function, either on finite words or on infinite words, captured by a deterministic two-way transducer, can be described with a regular transducer expression ...
Dave, Vrunda +2 more
openaire +5 more sources
Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions [PDF]
EPTCS 334, 2021, pp. 29-45, 2021 Milner (1984) introduced a process semantics for regular expressions as process graphs. Unlike for the language semantics, where every regular (that is, DFA-accepted) language is the interpretation of some regular expression, there are finite process graphs that are not bisimilar to the process interpretation of any regular expression.
arxiv +1 more source
Scientific reference style using rule-based machine learning
IJAIN (International Journal of Advances in Intelligent Informatics), 2023 Regular Expressions (RegEx) can be employed as a technique for supervised learning to define and search for specific patterns inside text. This work devised a method that utilizes regular expressions to convert the reference style of academic papers into
Afrida Helen +2 more
doaj +1 more source
A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata [PDF]
Maejo International Journal of Science and Technology, 2013 Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata.
Ajay Kumar, Anil Kumar Verma
doaj +1 more source
The use of syntax trees in order to automate the correction of LaTeX documents [PDF]
Компьютерные исследования и моделирование, 2012 The problem is to automate the correction of LaTeX documents. Each document is represented as a parse tree. The modified Zhang-Shasha algorithm is used to construct a mapping of tree vertices of the original document to the tree vertices of the edited ...
Kirill Vladimirovich Chuvilin
doaj +1 more source
Forkable Regular Expressions [PDF]
, 2016 We consider forkable regular expressions, which enrich regular expressions with a fork operator, to establish a formal basis for static and dynamic analysis of the communication behavior of concurrent programs. We define a novel compositional semantics for forkable expressions, establish their fundamental properties, and define derivatives for them as ...
Sulzmann, Martin, Thiemann, Peter
openaire +3 more sources
Rewriting of regular expressions and regular path queries [PDF]
Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 1999 AbstractRecent work on semi-structured data has revitalized the interest in path queries, i.e., queries that ask for all pairs of objects in the database that are connected by a path conforming to a certain specification, in particular to a regular expression.
Diego Calvanese +3 more
openaire +4 more sources