The stateless deterministic ordered restarting automata accept exactly the regular languages, and it is known that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent DFA is at least double exponential. Here we present a construction that yields an equivalent NFA of size 2 from a stateless deterministic ordered restarting automaton that works on a...

IPv6 hosts using Stateless Address Autoconfiguration are able to configure their IPv6 address and default router settings automatically. However, further settings are not available. If these hosts wish to configure their DNS, NTP, or other specific settings automatically, the stateless variant of the Dynamic Host Configuration Protocol for IPv6 (DHCPv6) could be used. This combination of Statel...

File servers can be stateful or stateless. Stateful servers are keeping state information about their clients, whereas the stateless don't. Stateful servers have the big disadvantage that if the server crashes all the state information is lost. They are not very scalable due to the space overhead. Their big advantages are: shorter messages can be used and better performance. Stateless server ar...

We describe a secure transformation of stateful connections or parts of them into stateless ones by attaching the state information to the messages. Secret-key cryptography is used for protection of integrity and con dentiality of the state data and the connections. The stateless protocols created in this way are more robust against denial of service resulting from high loads and resource exhau...

We present two stateless algorithms that guarantee to deliver the message to every device in a designated geographic area: flooding and planar geocasting. Due to the algorithms’ statelessness, intermediate devices do not have to keep message data between message transmissions. We formally prove the algorithms correct, estimate their message complexity and evaluate their performance through simu...

We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In particular, we investigate the decidability of the emptiness and reachability problems for these stateless automata and show that the results are applicable to similar questions concerning certain variants of P systems...

This paper offers a finite, ground-complete axiomatization of stateless bisimilarity over the tuple-space-based coordination language Linda. As stepping stones towards that result, axiomatizations of stateless bisimilarity over the sequential fragment of Linda without the nask primitive, and over the full sequential sublanguage are given. It is also shown that stateless bisimilarity coincides w...

In this paper, we propose a family of lightweight block ciphers CHAM that has remarkable efficiency on resource-constrained devices. The family consists of three ciphers, CHAM-64/128, CHAM-128/128, and CHAM-128/256 which are of the generalized 4-branch Feistel structure based on ARX(Addition, Rotation, XOR) operations. In hardware implementations, CHAM requires smaller areas (73% on average) th...

This paper identifies the current difficulties faced by the IT professionals working for collaborative enterprises and explains how we exploit and extend the so-called stateless client systems to support those individuals in cooperative work. Stateless client systems are the software tools that separate the display interface from the application logic in windowing systems. They embed a client/s...