Results 1 to 10 of about 889,414 (343)
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity.
Jos C. M. Baeten +3 more
doaj +11 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 +4 more sources
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
Categorizing Event Sequences Using Regular Expressions
IASSIST Quarterly, 1998 Categorizing Event Sequences Using Regular ...
Lisa Sanfilippo
doaj +3 more sources
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions [PDF]
arXiv, 2013 The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions.
F. Manea +10 more
arxiv +4 more sources
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower
Hermann Gruber, Markus Holzer
doaj +4 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
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
Graphs Encoded by Regular Expressions [PDF]
, 2011 In the conversion of finite automata to regular expressions, an exponential blowup in size can generally not be avoided. This is due to graph-structural properties of automata which cannot be directly encoded by regular expressions and cause the blowup ...
Stefan Gulan
openalex +5 more sources
Biological Sequence Analysis Using Regular Expressions
BioTechniques, 1999 Robert M. Horton
doaj +2 more sources