1054 search results - page 33 / 211 » Guarded Expressions in Practice |
EJC
2010
13 years 11 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
WIA
2009
Springer
14 years 5 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
AUSAI
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Temporal expressions—references to points in time or periods of time—are widespread in text, and their proper interpretation is essential for any natural language pro...
ACMACE
2006
ACM
14 years 5 months ago
2006
ACM
This paper focuses on the mapping strategies in the interface design for the Expression Synthesis Project (ESP). The goal of ESP is to use the metaphor of driving to allow non-exp...
MFCS
2004
Springer
14 years 4 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...