Results 71 to 80 of about 7,287,958 (273)
The Design of a Verified Derivative-Based Parsing Tool for Regular Expressions
CLEI Electronic Journal, 2021 We describe the formalization of Brzozowski and Antimirov derivative based algorithms for regular expression parsing, in the dependently typed language Agda.
Elton Cardoso +5 more
doaj +1 more source
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
, 2007 We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes.
A. Amir +15 more
core +4 more sources
(Un)Decidability Results for Word Equations with Length and Regular Expression Constraints [PDF]
, 2013 We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints.
Ganesh, Vijay +3 more
core
, 2018 We show that fulfilling a rectangular crossword table with a regular expression for each row and each column is very hard.
T. Nguyen
semanticscholar +1 more source
The regular part of second-order differential sectorial forms with lower-order terms
, 2013 We present a formula for the regular part of a sectorial form that represents a general linear second-order differential expression that may include lower-order terms. The formula is given in terms of the original coefficients.
Sauter, Manfred, ter Elst, A. F. M.
core +1 more source
Entanglement, decoherence and thermal relaxation in exactly solvable models
, 2011 Exactly solvable models provide an opportunity to study different aspects of reduced quantum dynamics in detail. We consider the reduced dynamics of a single spin in finite XX and XY spin 1/2 chains. First we introduce a general expression describing the
Mossel J, Oleg Lychkovskiy
core +1 more source
PaREM: A Novel Approach for Parallel Regular Expression Matching [PDF]
IEEE International Conference on Computational Science and Engineering, 2014 Regular expression matching is essential for many applications, such as finding patterns in text, exploring substrings in large DNA sequences, or lexical analysis.
Suejb Memeti, Sabri Pllana
semanticscholar +1 more source
Improved DFA algorithm based on multi-dimensional finite automata
Tongxin xuebao, 2015 Compiling multiple regular expression signatures into a combined DFA can blowup in state and storage space.Explanations from the prospective of information theory and multi-dimensional mathematical model were proposed fo-cusing on the most serious state ...
ONGYang-yang G +6 more
doaj +2 more sources
Complexity measures for regular expressions
Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74, 1974 Several measures of the complexity of a regular expression are defined. (Star height and number of alphabetical symbols are two of them.) Upper and lower estimates for the complexities of expressions for certain sets of paths on graphs are derived.
Andrzej Ehrenfeucht, Paul Zeiger
openaire +3 more sources
Regular expression based pattern extraction from a cell - Specific gene expression data
Informatics in Medicine Unlocked, 2019 Cancer cells are formed when active genes stop functioning properly. Timely activation of a gene is governed through the combined effort of multiple Transcription Factors (TFs). TFs are proteins that bind on DNA in a sequence-specific manner.
Suja Subramanian, Tessamma Thomas
doaj +1 more source