3724 search results - page 17 / 745 » Timed regular expressions |
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.
VLSISP
2008
13 years 7 months ago
2008
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
POPL
2001
ACM
14 years 8 months ago
2001
ACM
DLT
2008
13 years 9 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...