Sciweavers

223 search results - page 5 / 45
» Construction of Tree Automata from Regular Expressions
Sort
View
ICALP
2009
Springer
14 years 7 months ago
On Regular Temporal Logics with Past,
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
JFP
2006
90views more  JFP 2006»
13 years 7 months ago
Regular expression filters for XML
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...
Haruo Hosaya
CAV
2004
Springer
130views Hardware» more  CAV 2004»
13 years 11 months ago
Global Model-Checking of Infinite-State Systems
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
Nir Piterman, Moshe Y. Vardi
ACL
1996
13 years 8 months ago
Compilation of Weighted Finite-State Transducers from Decision Trees
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
Richard Sproat, Michael Riley
ACTA
2000
302views more  ACTA 2000»
13 years 7 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
Danny Dubé, Marc Feeley