Communicating reaction systems are new variants of networks of reaction systems where the components communicate with each other by sending products or reactions. Reaction system, a mathematical formalism inspired by ...
详细信息
The theory of P systems or membrane systems, a vivid scientific area in bio-inspired computing, deals with computational models inspired by architecture and functioning of living cells and tissues, and neural systems....
详细信息
We introduce and examine two variants of networks of reaction systems, called communicating reaction systems with direct communication, where the reaction systems send products or reactions to each other. We show that...
详细信息
This paper investigates a novel calibration process of devices with different modalities, which is a critical step of computer vision applications. We propose a fully automatic extrinsic calibration of a LiDAR-camera ...
详细信息
ISBN:
(数字)9781728173955
ISBN:
(纸本)9781728173962
This paper investigates a novel calibration process of devices with different modalities, which is a critical step of computer vision applications. We propose a fully automatic extrinsic calibration of a LiDAR-camera system. Our approach applies sphere as their surfaces and contours can be accurately detected on point clouds and camera images, respectively. Experiments on synthetic and real data exhibit that our automatic algorithm is fast and robust and it yields accurate camera and LiDAR extrinsic parameters.
The general concept, called the formal framework of P systems provides a representation to study and analyze different variants of P systems. In this paper, two well-known models, P colonies and P systems with multi-s...
详细信息
Generalized communicating P systems are particular variants of networks of cells where each rule moves only two objects. In this paper we show that GCPSs with three cells and with only join, or only split, or only cha...
详细信息
We investigate the possibility of "going beyond" Turing in the terms of Automaton-like P Colonies (APCol systems, for short), variants of P colonies processing strings as their environments. We use the notio...
详细信息
This paper gives simple tree-based conditions under which regular-controlled context-free grammars generate context-free languages of finite index, so they cannot even generate all context-free languages. It defines t...
详细信息
In this paper we establish a connection between two concepts of unconventional computing, namely Watson-Crick T0L systems (schemes) and red-green Turing machines or redgreen register machines. Our research was inspire...
详细信息
In this paper we establish a connection between two concepts of unconventional computing, namely Watson-Crick T0L systems (schemes) and red-green Turing machines or redgreen register machines. Our research was inspired by the conceptual similarity of a mind change of a red-green Turing or register machine and of a turn to the complementary string in Watson- Crick T0L systems as well as by the fact that both red-green Turing or register machines and Watson-Crick T0L systems define infinite computations on finite inputs. We define language recognition for Watson-Crick T0L systems based on the infinite sequences they generate, and we show that the sets of (vectors of) natural numbers which can be recognized by so-called standard Watson-Crick T0L schemes (with a context-free trigger) include the sets recognized by red-green register machines (or red-green Turing machines). The obtained results imply that using Watson- Crick T0L schemes we may "go beyond Turing" as the red-green register machines and red-green Turing machines can do. Furthermore, we also show that for any deterministic Watson-Crick 0L scheme with a regular trigger the recognizability problem of a word is decidable.
暂无评论