In parallel and distributed computing, development of an efficient static task scheduling algorithm for directed acyclic graph (DAG) applications is an importan
In this paper , we have established an intimate connection between near-nings and linear automata,and obtain the following results: 1) For a near-ring N there e