4985 search results - page 1 / 997 » Observation of String-Rewriting Systems |
FUIN
2006
13 years 5 months ago
2006
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 ...
ENTCS
2008
13 years 5 months ago
2008
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that both of termination and confluence for l...
RTA
2007
Springer
13 years 11 months ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A partial monoid P is a set with a partial multiplication
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...