Synchronization transitions are investigated in coupled chaotic maps. Depending on the relative weight of linear versus nonlinear instability mechanisms associated to the single map two different scenarios for the transition may occur. When only two maps are considered we always find that the critical coupling εl for chaotic synchronization can be predicted within a linear analysis by the vanis...

A formal graph system (FGS for short) is a logic program consisting of definite clauses whose arguments are patterns instead first-order terms. The referred to as rewriting rules. An FGS shown be useful unifying framework learning languages. In this paper, we show the polynomial-time PAC learnability subclass languages defined by parameterized hereditary FGSs with bounded degree, from viewpoint...

There are different ways for an external agent to influence the outcome of an election. We concentrate on “control” by adding or deleting candidates of an election. Our main focus is to investigate the parameterized complexity of various control problems for different voting systems. To this end, we introduce natural digraph problems that may be of independent interest. They help in determining...

A neural network based approach is presented for controlling two distinct types of nonlinear systems. The first corresponds to nonlinear systems with parametric uncertainties where the parameters occur nonlinearly. The second corresponds to systems for which stabilizing control structures cannot be determined. The proposed neural controllers are shown to result in closed-loop system stability u...