Sciweavers

315 search results - page 32 / 63
» Reactive Turing Machines
Sort
View
DLT
2003
13 years 10 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer
DAM
2002
125views more  DAM 2002»
13 years 8 months ago
Complexity of Langton's ant
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...
Anahí Gajardo, Andrés Moreira, Eric ...
FUIN
2002
90views more  FUIN 2002»
13 years 8 months ago
A Direct Construction of a Universal P System
We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of anothe...
Pierluigi Frisco, Hendrik Jan Hoogeboom, Paul Sant
MST
2007
90views more  MST 2007»
13 years 8 months ago
Optimal Semicomputable Approximations to Reachable and Invariant Sets
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...
Pieter Collins
MST
2011
182views Hardware» more  MST 2011»
13 years 3 months ago
Tilings and Submonoids of Metabelian Groups
Abstract. In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product Z ≀ (Z × Z). ...
Markus Lohrey, Benjamin Steinberg