Sciweavers

242 search results - page 32 / 49
» Zigzags in Turing Machines
Sort
View
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
SIGCSE
1999
ACM
145views Education» more  SIGCSE 1999»
13 years 12 months ago
Using JFLAP to interact with theorems in automata theory
An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback...
Eric Gramond, Susan H. Rodger
VL
1998
IEEE
134views Visual Languages» more  VL 1998»
13 years 12 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 12 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 12 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...