Results 21 to 30 of about 889,414 (343)
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
The inclusion problem for regular expressions [PDF]
Journal of Computer and System Sciences, 2011 AbstractThis paper presents a polynomial-time algorithm for the inclusion problem for a large class of regular expressions. The algorithm is not based on construction of finite automata, and can therefore be faster than the lower bound implied by the Myhill–Nerode theorem.
Dag Hovland
openalex +8 more sources
Implication of regular expressions
Applied Mathematics Letters, 2011 AbstractIn this work we study the following implication problem for regular expressions: “Given a set of regular expressions R and a regular expression S, is it true that every string which matches the regular expressions in R also matches S?” The problem comes in two flavors: “non-disjoint” and “disjoint”. We show that both of them are PSPACE-complete.
Alex Thomo
openalex +3 more sources
Efficient Construction of the Equation Automaton
Algorithms, 2021 This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression.
Faissal Ouardi +2 more
doaj +1 more source
Text Indexing for Regular Expression Matching
Algorithms, 2021 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.
Daniel Gibney, Sharma V. Thankachan
doaj +1 more source
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
IEEE Access, 2020 The Multifamily classification of Android malware aims to identify a malicious sample as one of the given malware families. This problem is believed to be much more significant than the binary classification (simply identify a sample as malicious or ...
Xiaojian Liu +3 more
doaj +1 more source
Application of Regular Grammar in the Syntactic Analysis of Email Addresses
Ingeniería, 2023 Context: This article proposes the use of regular grammar as a strategy to validate the textual structures of emails. It focuses on the RFC 5321 standard and its syntax, formalizing regular grammars to apply production rules with the aim of validating ...
Cristian Alejandro Fandiño-Mesa +2 more
doaj +1 more source
The Complexity of Aggregates over Extractions by Regular Expressions [PDF]
Logical Methods in Computer Science, 2023 Regular expressions with capture variables, also known as regex-formulas, extract relations of spans (intervals identified by their start and end indices) from text.
Johannes Doleschal +2 more
doaj +1 more source
Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In the last years, various extensions of ω-regular languages have been proposed in the literature, including ωB-regular (ω-regular languages extended with boundedness), ωS-regular (ω-regular languages extended with strict unboundedness), and ωBS-regular ...
Dario Della Monica +2 more
doaj +1 more source