Learn More
We propose a measure of complexity for symbolic sequences, which is based on conditional probabilities, and captures computational aspects of complexity without the explicit construction of minimal deterministic finite automata (DFA). Moreover, if the sequence is obtained from a dynamical system through a suitable encoding and its equations of motion are(More)
Today's wireless sensor networks provide the possibility to monitor physical environments via small low-cost wireless devices. Given the large amount of sensed data, efficient and robust classification becomes a critical task in many applications. Typically, the devices must operate under stringent power and communication constraints and the transmission of(More)
  • 1