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 ...
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...
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...
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,...
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...