Abstract: Arithmetic operations and expression evaluations are fundamental in computing models. We firstly designs a family of P systems for arithmetic operations (called arithmetic P systems) and gives the rules without priority. According to the arithmetic expression,an expression P system can be constructed through the algorithm and transmission rules proposed in this paper. Arithmetic P systems are one-membrane systems and several of them can make up an expression P system, where arithmetic operations can be performed in parallel and the computing results can be transmitted under the control of the transmission rules. Then a computing architecture can be built and based on it different expression P systems can be constructed by designin...
Today, certain computer software systems exist which surpass the computational ability of researcher...
We define algebraic systems called concurrent regular expressions which provide a modular descriptio...
W: Bulletin ofthe Polish Academy of Sciences, Technical Sciences, 9(9):527-529, 196
AbstractIn this article, we focus on the synthesis of arithmetic expressions that can be evaluated e...
The problem of parsing and compiling arithmetic expressions in parallel computational environments i...
This paper provides the description of my research project on the computational power a programming ...
Arithmetic expressions are the fundamental building blocks of hardware and software systems. An impo...
Abstract. Computer arithmetic algorithms usually are represented by circuit diagrams which do not se...
Parallel algorithms for parsing expressions on mesh, shuffle, cube, and cube-connected cycle paralle...
Considering the advantages of distribution and maximum parallelism of membrane computing and availab...
Following, we present in this paper various number encodings and operations over multisets. We obtai...
AbstractParallel algorithms for evaluating arithmetic expressions generally assume the computation t...
A new parallel algorithm for transforming an arithmetic infix expression into a par se tree is prese...
This thesis defines a new formal model „transducer system." Transducer system is composed of a...
This paper presents a novel approach to au-tomatically solving arithmetic word problems. This is the...
Today, certain computer software systems exist which surpass the computational ability of researcher...
We define algebraic systems called concurrent regular expressions which provide a modular descriptio...
W: Bulletin ofthe Polish Academy of Sciences, Technical Sciences, 9(9):527-529, 196
AbstractIn this article, we focus on the synthesis of arithmetic expressions that can be evaluated e...
The problem of parsing and compiling arithmetic expressions in parallel computational environments i...
This paper provides the description of my research project on the computational power a programming ...
Arithmetic expressions are the fundamental building blocks of hardware and software systems. An impo...
Abstract. Computer arithmetic algorithms usually are represented by circuit diagrams which do not se...
Parallel algorithms for parsing expressions on mesh, shuffle, cube, and cube-connected cycle paralle...
Considering the advantages of distribution and maximum parallelism of membrane computing and availab...
Following, we present in this paper various number encodings and operations over multisets. We obtai...
AbstractParallel algorithms for evaluating arithmetic expressions generally assume the computation t...
A new parallel algorithm for transforming an arithmetic infix expression into a par se tree is prese...
This thesis defines a new formal model „transducer system." Transducer system is composed of a...
This paper presents a novel approach to au-tomatically solving arithmetic word problems. This is the...
Today, certain computer software systems exist which surpass the computational ability of researcher...
We define algebraic systems called concurrent regular expressions which provide a modular descriptio...
W: Bulletin ofthe Polish Academy of Sciences, Technical Sciences, 9(9):527-529, 196