244 search results - page 27 / 49 » Turing machines and bimachines |
SIGCSE
1999
ACM
15 years 4 months ago
1999
ACM
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...
IANDC
1998
14 years 11 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
SSS
2010
Springer
14 years 10 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
120
click to vote
NC
2011
14 years 6 months ago
2011
We consider recognizer P systems having three polarizations associated to the membranes, and we show that they are able to solve the PSPACEcomplete problem Quantified 3SAT when wo...
130
click to vote
NC
2011
14 years 2 months ago
2011
In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct ...