Abstract. We present a soundness theorem for a dependent type theory with context conith respect to an indexed category of (finite, abstract) simplical complexes. The point of int...
Abstract. We study a subclass of tree-to-word transducers: linear treeto-word transducers, that cannot use several copies of the input. We aim to study the equivalence problem on t...
Abstract. Finding minimal separating sequences for all pairs of inequivalent states in a finite state machine is a classic problem in automata theory. Sets of minimal separating s...
Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (V...
Capacitated automata (CAs) have been recently introduced in [8] as a variant of finite-state automata in which each transition is associated with a (possibly infinite) capacity. ...
Abstract We introduce the Transregional Collaborative Research Centre “Companion-Technology for Cognitive Technical Systems” – a cross-disciplinary endeavor towards the devel...
Companion-technology is an emerging field of cross-disciplinary research. It aims at developing technical systems that appear as “Companions” to their users. They serve as co-...
This article deals with a novel multi-screen interactive TV setup (smarTVision) and its enhancement through Companion-Technology. Due to their flexibility and the variety of inter...
Jan Gugenheimer, Frank Honold, Dennis Wolf, Felix ...