Results 21 to 30 of about 5,692,247 (342)
Parameterized regular expressions and their languages [PDF]
Theoretical Computer Science, 2013 We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if it is denoted by some regular expression obtained by replacing variables with letters; under the certainly ...
Barceló Baeza, Pablo +2 more
openaire +12 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 ...
Champarnaud, Jean-Marc +2 more
openaire +8 more sources
Implication of regular expressions
Applied Mathematics Letters, 2012 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
openaire +3 more sources
Biological Sequence Analysis Using Regular Expressions
BioTechniques, 1999 Robert M. Horton
doaj +2 more sources
Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete: Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions [PDF]
Logic in Computer Science, 2022 Milner (1984) defined a process semantics for regular expressions. He formulated a sound proof system for bisimilarity of process interpretations of regular expressions, and asked whether this system is complete.
C. Grabmayer
semanticscholar +1 more source
POSIX Lexing with Derivatives of Regular Expressions
Journal of automated reasoning, 2023 Brzozowski introduced the notion of derivatives for regular expressions. They can be used for a very simple regular expression matching algorithm.
Fahad Ausaf +2 more
semanticscholar +1 more source
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity [PDF]
Logic in Computer Science, 2020 Robin Milner (1984) gave a sound proof system for bisimilarity of regular expressions interpreted as processes: Basic Process Algebra with unary Kleene star iteration, deadlock 0, successful termination 1, and a fixed-point rule.
C. Grabmayer, W. Fokkink
semanticscholar +1 more source
Playspecs: Regular Expressions for Game Play Traces
Artificial Intelligence and Interactive Digital Entertainment Conference, 2021 We introduce Playspecs, an application of omega-regular expressions to specifying play traces (sequences of game states or events unfolding over time).
J. Osborn +3 more
semanticscholar +1 more source
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length [PDF]
International Conference on Computer Aided Verification, 2020 We present a novel length-aware solving algorithm for the quantifier-free first-order theory over regex membership predicate and linear arithmetic over string length.
Murphy Berzish +6 more
semanticscholar +1 more source