Results 261 to 270 of about 81,118 (297)
Some of the next articles are maybe not open access.
On a generalization of regular expression
Programming and Computer Software, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksei L. Gomozov +1 more
openaire +2 more sources
Journal of the ACM, 2002
In this article, we definetimed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to thetimed automataof Alur and Dill. This result is the timed analogue of Kleene Theorem and, similarly to that result, the hard part in the proof is the translation ...
Eugene Asarin, Paul Caspi, Oded Maler
openaire +1 more source
In this article, we definetimed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to thetimed automataof Alur and Dill. This result is the timed analogue of Kleene Theorem and, similarly to that result, the hard part in the proof is the translation ...
Eugene Asarin, Paul Caspi, Oded Maler
openaire +1 more source
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 +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 ...
Su-Hyeon Kim, Hyeonseung Im, Sang-Ki Ko
openaire +1 more source
1998
In this paper, we consider the problem verifying hybrid systems modelled by linear hybrid automata. We extend the traditional regular expressions with time constraints and use them as a language to describe the behaviour of a class of linear hybrid automata. The extended notation is called Hybrid Regular Expression (HRE).
Xuandong Li +4 more
openaire +1 more source
In this paper, we consider the problem verifying hybrid systems modelled by linear hybrid automata. We extend the traditional regular expressions with time constraints and use them as a language to describe the behaviour of a class of linear hybrid automata. The extended notation is called Hybrid Regular Expression (HRE).
Xuandong Li +4 more
openaire +1 more source
2013
Most software packages with regular expression matching engines offer operators that extend the classical regular expressions, such as counting, intersection, complementation, and interleaving. Some of the most popular engines, for example those of Java and Perl, also provide operators that are intended to control the nondeterminism inherent in regular
Martin Berglund +4 more
openaire +1 more source
Most software packages with regular expression matching engines offer operators that extend the classical regular expressions, such as counting, intersection, complementation, and interleaving. Some of the most popular engines, for example those of Java and Perl, also provide operators that are intended to control the nondeterminism inherent in regular
Martin Berglund +4 more
openaire +1 more source
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 ...
Berteun Damman +2 more
openaire +1 more source
A Survey of Regular Expressions and Their Applications
IRE Transactions on Electronic Computers, 1962This paper is an exposition of the theory of regular expressions and its applications to sequential circuits. The results of several authors are presented in a unified manner, pointing out the similarities and differences in the various treatments of the subject. Whenever possible, the terminology and notation of sequential circuit theory are used. The
openaire +2 more sources
Proceedings of the sixth international conference on Information and knowledge management, 1997
Ken Nakayama +2 more
openaire +1 more source
Ken Nakayama +2 more
openaire +1 more source
Ensuring the Correctness of Regular Expressions: A Review
International Journal of Automation and Computing, 2021Li-Xiao Zheng, Shuai Ma
exaly