3724 search results - page 169 / 745 » Timed regular expressions |
IANDC
2002
15 years 4 months ago
2002
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
122
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
213
click to vote
ICIP
2009
IEEE
16 years 5 months ago
2009
IEEE
Fast level set methods replace continuous PDEs by a discrete formulation, improving the execution times. The regularization in fast level set methods was so far handled indirectly...
153
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
125
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
In this paper, we outline general design steps of our synthesis tool to realize application specific co-processors such that for a given scientific application having intensive ite...