Sciweavers

6 search results - page 1 / 2
» Adding constants to string rewriting
Sort
View
AAECC
2008
Springer
110views Algorithms» more  AAECC 2008»
13 years 5 months ago
Adding constants to string rewriting
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
René Thiemann, Hans Zantema, Jürgen Gi...
FUIN
2006
66views more  FUIN 2006»
13 years 5 months ago
Observation of String-Rewriting Systems
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
Matteo Cavaliere, Peter Leupold
FUIN
2007
120views more  FUIN 2007»
13 years 5 months ago
Concurrent Turing Machines
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
Berndt Farwer, Manfred Kudlek, Heiko Rölke
SIAMDM
2010
137views more  SIAMDM 2010»
13 years 4 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
GPCE
2007
Springer
13 years 12 months ago
Preventing injection attacks with syntax embeddings
Software written in one language often needs to construct sentences in another language, such as SQL queries, XML output, or shell command invocations. This is almost always done ...
Martin Bravenboer, Eelco Dolstra, Eelco Visser