Sciweavers

244 search results - page 40 / 49
» Turing machines and bimachines
Sort
View
PROVSEC
2009
Springer
13 years 12 months ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo
VL
1998
IEEE
134views Visual Languages» more  VL 1998»
13 years 11 months ago
Visual Semantics - Or: What You See is What You Compute
We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...
Martin Erwig
KR
1998
Springer
13 years 11 months ago
What Robots Can Do
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
Hector J. Levesque
SIGCSE
1997
ACM
158views Education» more  SIGCSE 1997»
13 years 11 months ago
A collection of tools for making automata theory and formal languages come alive
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
Susan H. Rodger, Anna O. Bilska, Kenneth H. Leider...
ICALP
1994
Springer
13 years 11 months ago
On some Relations between Dynamical Systems and Transition Systems
Abstract. In this paper we de ne a precise notion of abstraction relation between continuous dynamical systems and discrete state-transition systems. Our main result states that ev...
Eugene Asarin, Oded Maler