227 search results - page 43 / 46 » P Systems and Finite Automata |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice,...
EUROCRYPT
2004
Springer
14 years 3 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
SICHERHEIT
2010
13 years 7 months ago
2010
Intrusion-tolerant replication enables the construction of systems that tolerate a finite number of malicious faults. An arbitrary number of faults can be tolerated during system ...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
SPAA
2009
ACM
14 years 10 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...