Search Results

We have introduced and extended the notion of swarm automaton to analyze the computability using swarm movement represented by multiset rewriting. The two transitions, parallel and sequential, are considered to transform a configuration of ...

Based on swarm movements and computing models using multisets, a swarm automaton was introduced to construct a new computing system using swarm behavior in the computing process. In a swarm automaton, each agent changes by input and the ...

Global transformations form a categorical framework adapting graph transformations to describe fully synchronous rule systems on a given data structure. In this work we focus on data structures that can be captured as presheaves and study the ...

In this paper, we study some properties of semigroups with presentation $〈a,,,b,,,c,,;,,a^p,=,b^s,,,b^r,=,c^v,,,c^u,=,a^q〉$. We will determine a complete rewriting system for the semigroup which could be useful for cryptosystems.

We initiate an algebraic approach to study DNA origami structures. We identify two types of basic building blocks and describe a DNA origami structure by their composition. These building blocks are taken as generators of a monoid, called the ...

Swarm-based computing models and multi-agent-based models have been investigated using parallel processing computation. Based on the preceding models and multiset computings, we propose new computing systems, called swarm systems, that are ...

We study the derivational complexities of string rewriting systems. We discuss the following fundamental question: which functions can be derivational complexities of terminating finite string rewriting systems? They are recursive, but for any recursive ...

Many rewriting systems with context-free productions and with controlled derivations have been studied. On one hand, these systems preserve the simplicity of applications of context-free productions and, on the other hand, they increase the generative ...

Length-two string rewriting systems are length-preserving string rewriting systems that consist of length-two rules. This paper shows that confluence, termination, left-most termination and right-most termination are undecidable properties for length-...

In this paper we study rewriting techniques for monoid semirings. Based on disjoint and non-disjoint representations of the elements of monoid semirings we define two different reduction relations. We prove that in both cases the reduction relation ...

We develop an abstract computational model, the abstract rewriting system on multisets, called ARMS, to deal with systems with a large number of degree of freedom, like liquids, and to confirm that they can simulate the emergence of the complex ...