Results 301 to 310 of about 889,414 (343)
Gesture Reduces Mapping Difficulties in the Development of Spatial Language Depending on the Complexity of Spatial Relations. [PDF]
Ünal E+4 more
europepmc +1 more source
Menstrual health practices among Tibetan women: An ethnographic participant observation study. [PDF]
Dhadwal Y, Kumar A, Pandey SR.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Regular expressions on the web
2010 12th IEEE International Symposium on Web Systems Evolution (WSE), 2010On the web, static pages fade into the past; web sites use server and client-side scripting techniques to improve the user experience. For client-side scripting, JavaScript is by far the most commonly used dynamic language. In these scripts, regular expressions are widely used for several purposes, e.g., for text filtering and form validation.
Hodován Renáta+2 more
openaire +3 more sources
Regular Expressions for PCTL Counterexamples
2008 Fifth International Conference on Quantitative Evaluation of Systems, 2008Counterexamples for probabilistic reachability in Markov chains are sets of paths that all reach a goal state and whose cumulative likelihood exceeds a threshold. This paper is concerned with the issue of how to conveniently represent these sets. Experiments, partially substantiated with combinatorial arguments, show that the cardinality of such sets ...
Damman B., Han T., Katoen J.-P.
openaire +2 more sources
Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis
2021We study the problem of synthesizing regular expressions from a set of positive and negative strings. The previous synthesis algorithm proposed by Lee et al. [12] relies on the best-first enumeration of regular expressions. To improve the performance of the enumeration process, we define a new normal form of regular expressions called the concise ...
Hyeonseung Im, Sang-Ki Ko, Su-Hyeon Kim
openaire +2 more sources
Approximate matching of regular expressions
Bulletin of Mathematical Biology, 1989Given a sequence A and regular expression R, the approximate regular expression matching problem is to find a sequence matching R whose optimal alignment with A is the highest scoring of all such sequences. This paper develops an algorithm to solve the problem in time O(MN), where M and N are the lengths of A and R.
Webb Miller, Eugene W. Myers
openaire +3 more sources
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming, 2010
Cody, Hazel, and Theo, two experienced Haskell programmers and an expert in automata theory, develop an elegant Haskell program for matching regular expressions: (i) the program is purely functional; (ii) it is overloaded over arbitrary semirings, which not only allows to solve the ordinary matching problem but also supports other applications like ...
WilkeThomas, HuchFrank, FischerSebastian
openaire +3 more sources
Cody, Hazel, and Theo, two experienced Haskell programmers and an expert in automata theory, develop an elegant Haskell program for matching regular expressions: (i) the program is purely functional; (ii) it is overloaded over arbitrary semirings, which not only allows to solve the ordinary matching problem but also supports other applications like ...
WilkeThomas, HuchFrank, FischerSebastian
openaire +3 more sources
Introducing Regular Expressions
2016To get a head start on introducing regular expressions, I’ll start with an example. It’s one that you’ve experienced hundreds of times. When you enter customer data online, many web forms ask you for an email address. To avoid an incorrectly typed address, an immediate validation makes sense.
openaire +2 more sources
2019
Regular Expression are a very powerful way of processing text while looking for recurring patterns; they are often used with data held in plain text files (such as log files), CSV files as well as Excel files. This chapter introduces regular expressions, discusses the syntax used to define a regular expression pattern and presents the Python re module ...
openaire +2 more sources
Regular Expression are a very powerful way of processing text while looking for recurring patterns; they are often used with data held in plain text files (such as log files), CSV files as well as Excel files. This chapter introduces regular expressions, discusses the syntax used to define a regular expression pattern and presents the Python re module ...
openaire +2 more sources