Titlebook: Information and Communication Technologies in Education, Research, and Industrial Applications; 11th International C Vitaliy Yakovyna,Heinr

nostrum

Solving NP-complete Problems in Polynomial Time by Using a Natural Computing Modelon model provided by P systems with active membranes (with neither polarization nor division rules). An important step of this semi-uniform solution is given by polynomial computing devices to build P systems that contain some exponential-size feature for which solving the SAT problem is easy. NP-co

declamation

ANTH

Realisation of Synchronous and Asynchronous Black Boxes Using Machinesads to the dominance of information systems implemented in accordance with an event-driven architecture. This trend attracts attention of researchers to systems based on event stream processing. In the paper it is proposed to distinguish two classes of event stream processing systems, namely, system

反應(yīng)

PARA

Abstracting an Operational Semantics to Finite Automatahe reasons why simple proofs break, among them artifacts in the semantics that lead to stuttering steps in the simulation. We then present a semantics based on the zipper data structure, with a direct interpretation of evaluation as navigation in the syntax tree. The abstraction function is then defined by an equivalence class construction.