206 search results - page 34 / 42 » Regular Expressions into Finite Automata |
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
TCS
2008
13 years 7 months ago
2008
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
CONCUR
2004
Springer
14 years 23 days ago
2004
Springer
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
JUCS
2010
13 years 5 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
JCC
2010
13 years 5 months ago
2010
The Poisson-Boltzmann equation is an important tool in modeling solvent in biomolecular systems. In this paper, we focus on numerical approximations to the electrostatic potential...