Results 21 to 30 of about 7,287,958 (273)
Regular Expression Matching using Bit Vector Automata
Proc. ACM Program. Lang., 2023 Regular expressions (regexes) are ubiquitous in modern software. There is a variety of implementation techniques for regex matching, which can be roughly categorized as (1) relying on backtracking search, or (2) being based on finite-state automata.
Alexis Le Glaunec +2 more
semanticscholar +1 more source
Synchronized Regular Expressions [PDF]
Electronic Notes in Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 ...
Shankara Narayanan Krishna +2 more
openaire +4 more sources
Generation of regular expressions for automata by the integral of regular expressions [PDF]
The Computer Journal, 1972 In this paper, the integral of regular expressions is defined and its properties are presented— The concept of the integral is then applied to establishing an algorithm for generating the regular expression of an arbitrary finite automaton specified by its state diagram or flow table.
Stephen S. Yau, L. W. Smith
openaire +3 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
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
Derivatives of approximate regular expressions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Automata, Logic and Semantics Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the notion of distance and we introduce the family of regular expressions ...
Jean-Marc Champarnaud +2 more
openalex +8 more sources
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
Sound regular expression semantics for dynamic symbolic execution of JavaScript [PDF]
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2018 Support for regular expressions in symbolic execution-based tools for test generation and bug finding is insufficient. Common aspects of mainstream regular expression engines, such as backreferences or greedy matching, are ignored or imprecisely ...
Blake Loring +2 more
semanticscholar +1 more source
Rewriting of regular expressions and regular path queries [PDF]
Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diego Calvanese +3 more
openaire +5 more sources