Now showing items 1-8 of 8
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language
(Institute of Informatics: University of Szeged, 2014)
A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by ``subword" we mean ``subsequence", ...
Planning and Deployment of Wireless Sensor Networks
(SAGE Publications (UK and US): Creative Commons Attribution, 2014-01-08)
Editorial introduction to special issue on Planning and Deployment of Wireless Sensor Networks published in the International Journal of Distributed Sensor Networks, 9(5). 2014.
On Achieving High Survivability in Virtualized Data Centers
(Institute of Electronics, Information and Communication Engineers, 2014-01-01)
As businesses are increasingly relying on the cloud to host their services, cloud providers are striving to offer guaranteed and highly-available resources. To achieve this goal, recent proposals have advocated to offer ...
Multimaterial Mesh-Based Surface Tracking
(Association for Computing Machinery, 2014-07-01)
We present a triangle mesh-based technique for tracking the evolution of three-dimensional multimaterial interfaces undergoing complex deformations. It is the first non-manifold triangle mesh tracking method to simultaneously ...
Regional Time Stepping for SPH
(The Eurographics Association, 2014)
This paper presents novel and efficient strategies to spatially adapt the amount of computational effort applied based on the local dynamics of a free surface flow, for classic weakly compressible SPH (WCSPH). Using a ...
Theory Of Atomata
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or ...
Syntactic Complexity Of R- And J-Trivial Regular Languages
(World Scientific Publishing, 2014-11-01)
The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We ...
Quotient Complexity Of Closed Languages
A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by factor we mean contiguous subsequence, ...