11716 search results - page 36 / 2344 » Computable symbolic dynamics |
CSR
2010
Springer
14 years 1 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
CHI
2005
ACM
14 years 10 months ago
2005
ACM
Guessability is essential for symbolic input, in which users enter gestures or keywords to indicate characters or commands, or rely on labels or icons to access features. We prese...
DIAGRAMS
2006
Springer
14 years 1 months ago
2006
Springer
Illustrating a dynamic process with an arrow-containing diagram is a widespread convention in people's daily communications. In order to build a basis for capturing the struct...
WEA
2005
Springer
14 years 3 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
ATVA
2007
Springer
14 years 3 months ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...