Results 261 to 270 of about 357,678 (301)
Some of the next articles are maybe not open access.
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
2003
The concept of regular expressions was introduced for the purpose of representing the languages accepted by deterministic finite automata. This is necessary in the analysis and synthesis of finite automata since the languages accepted by finite automata are usually infinite.
John N. Mordeson +2 more
openaire +2 more sources
The concept of regular expressions was introduced for the purpose of representing the languages accepted by deterministic finite automata. This is necessary in the analysis and synthesis of finite automata since the languages accepted by finite automata are usually infinite.
John N. Mordeson +2 more
openaire +2 more sources
1968
Publisher Summary This chapter discusses the regular expressions. Every regular set can be represented by a regular expression and every regular expression represents a regular set. Algebraic manipulations with regular expressions, and transition graphs are discussed. Various theorems are proved in the chapter.
openaire +2 more sources
Publisher Summary This chapter discusses the regular expressions. Every regular set can be represented by a regular expression and every regular expression represents a regular set. Algebraic manipulations with regular expressions, and transition graphs are discussed. Various theorems are proved in the chapter.
openaire +2 more sources
1999
regular expression matching is one of our favorite examples because it is chock-full of techniques. Regular expression matching provides a powerful way to examine strings. Instead of looking for exact matches, such as “Is the value of the string foo” or even “Does the string contain the substring foo,” regular expression matching lets you find patterns.
Michael Hyman, Phani Vaddadi
openaire +2 more sources
regular expression matching is one of our favorite examples because it is chock-full of techniques. Regular expression matching provides a powerful way to examine strings. Instead of looking for exact matches, such as “Is the value of the string foo” or even “Does the string contain the substring foo,” regular expression matching lets you find patterns.
Michael Hyman, Phani Vaddadi
openaire +2 more sources
2020
So, you think you know a lot about Perl Regular Expressions? If you finished Chapter 1, then you certainly do. But, there are more REs that provide you with powerful techniques to parse data.
openaire +2 more sources
So, you think you know a lot about Perl Regular Expressions? If you finished Chapter 1, then you certainly do. But, there are more REs that provide you with powerful techniques to parse data.
openaire +2 more sources