Results 11 to 20 of about 5,692,247 (342)
Regular Expressions with Lookahead [PDF]
Journal of Universal Computer Science, 2021 This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads. We show how to translate regular expressions with lookaheads (REwLA) to equivalent Boolean automata having ...
Martin Berglund +2 more
doaj +6 more sources
Regular expression types for XML [PDF]
Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, 2000 We propose regular expression types as a foundation for XML processing languages. Regular expression types are a natural generalization of Document Type Definitions (DTDs), describing structures in XML documents using regular expression operators (i.e., *, ?, |, etc.) and supporting a simple but powerful notion of
Hosoya, Haruo +2 more
+11 more sources
Categorizing Event Sequences Using Regular Expressions
IASSIST Quarterly, 1998 Categorizing Event Sequences Using Regular ...
Lisa Sanfilippo
doaj +3 more sources
Regular expression patterns [PDF]
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming, 2004 We extend Haskell with regular expression patterns . Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as found in Haskell. It has proven useful for string manipulation and for processing structured data such as XML.
Josef Svenningsson +2 more
openaire +3 more sources
Algorithms for Hidden Markov Models Restricted to Occurrences of Regular Expressions [PDF]
Biology, 2013 Hidden Markov Models (HMMs) are widely used probabilistic models, particularly for annotating sequential data with an underlying hidden structure. Patterns in the annotation are often more relevant to study than the hidden structure itself. A typical HMM
Thomas Mailund +4 more
doaj +2 more sources
Understanding Regular Expressions
The Programming Historian, 2013 In this exercise we will use advanced find-and-replace capabilities in a word processing application in order to make use of structure in a brief historical document that is essentially a table in the form of prose.
Doug Knox
doaj +3 more sources
Processing SPARQL queries with regular expressions in RDF databases [PDF]
BMC Bioinformatics, 2011 Background As the Resource Description Framework (RDF) data model is widely used for modeling and sharing a lot of online bioinformatics resources such as Uniprot (dev.isb-sib.ch/projects/uniprot-rdf) or Bio2RDF (bio2rdf.org), SPARQL - a W3C ...
Cho Hune +6 more
doaj +2 more sources
PhyloPattern: regular expressions to identify complex patterns in phylogenetic trees [PDF]
BMC Bioinformatics, 2009 Background To effectively apply evolutionary concepts in genome-scale studies, large numbers of phylogenetic trees have to be automatically analysed, at a level approaching human expertise.
Pontarotti Pierre +2 more
doaj +2 more sources
Regular expressions and the equivalence of programs
Journal of Computer and System Sciences, 1969 If we assume that the study and detection of equivalence for ALGOLl ike programs holds certain pragmatic interest, then it seems reasonable to pursue these matters despite the well-known undecidability of this property. Various efforts have been made to isolate decidable sub-cases of this equivalence problem (e.g., by Paterson [12] and this author [6]).
Donald M. Kaplan
openaire +4 more sources
The inclusion problem for regular expressions [PDF]
Journal of Computer and System Sciences, 2010 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
openaire +8 more sources