512 search results - page 31 / 103 » Automata as Abstractions |
WIA
2001
Springer
14 years 1 months ago
2001
Springer
d Abstract) Zhe Dang , Tevfik Bultan ¡ , Oscar H. Ibarra ¡ , and Richard A. Kemmerer ¡ ¢ School of Electrical Engineering and Computer Science Washington State University P...
FORMATS
2009
Springer
14 years 15 days ago
2009
Springer
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
STACS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each othe...
CSR
2007
Springer
14 years 17 days ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...