Sciweavers

500 search results - page 71 / 100
» Universality and Cellular Automata
Sort
View
CC
2004
Springer
122views System Software» more  CC 2004»
14 years 1 months ago
An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
Erin Parker, Siddhartha Chatterjee
DIGITEL
2007
IEEE
14 years 2 months ago
A Brief Survey of Distributed Computational Toys
Distributed Computational Toys are physical artifacts that function based on the coordination of more than one computing device. Often, these toys take the form of a microcontroll...
Eric Schweikardt, Mark D. Gross
ECAL
2007
Springer
14 years 2 months ago
Detecting Non-trivial Computation in Complex Dynamics
Abstract. We quantify the local information dynamics at each spatiotemporal point in a complex system in terms of each element of computation: information storage, transfer and mod...
Joseph T. Lizier, Mikhail Prokopenko, Albert Y. Zo...
PACT
2007
Springer
14 years 1 months ago
Orthogonal Organized Finite State Machine Application to Sensor Acquired Information
The application of the Orthogonal Organized Finite State Machine (OOFSM) to the representation of data acquired by sensor networks is proposed. The OOFSM was proposed in earlier wo...
Brian J. d'Auriol, John Kim, Sungyoung Lee, Young-...
ASIACRYPT
2005
Springer
14 years 1 months ago
A Near-Practical Attack Against B Mode of HBB
Stream cipher Hiji-Bij-Bij (HBB) was proposed by Sarkar at Indocrypt’03. This cipher uses cellular automata (CA). The algorithm has two modes: a basic mode (B) and a self-synchro...
Joydip Mitra