429 search results - page 41 / 86 » Noisy Turing Machines |
KR
1998
Springer
15 years 2 months ago
1998
Springer
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,...
SIGCSE
1997
ACM
15 years 1 months ago
1997
ACM
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...
ICALP
1994
Springer
15 years 1 months ago
1994
Springer
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...
COCO
1992
Springer
15 years 1 months ago
1992
Springer
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
MFCS
1989
Springer
15 years 1 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...