Sciweavers

278 search results - page 12 / 56
» Enumerating Regular Expressions and Their Languages
Sort
View
VLDB
2003
ACM
147views Database» more  VLDB 2003»
14 years 7 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
COLING
1994
13 years 8 months ago
Parsing A Flexible Word Order Language
A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their ...
Vladimir Pericliev, Alexander Grigorov
HYBRID
1998
Springer
13 years 11 months ago
Equations on Timed Languages
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
Eugene Asarin
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
ISOLA
2004
Springer
14 years 25 days ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah