Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
This paper describes GL4D, an interactive system for visualizing 2-manifolds and 3-manifolds embedded in four Euclidean dimensions and illuminated by 4D light sources. It is a tetr...
Alan Chu, Chi-Wing Fu, Andrew J. Hanson, Pheng-...
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...