Recently there has been a growing interest towards algebraic structures that are able to express formalisms diierent from the standard , tree-like presentation of terms. Many of these approaches reveal a speciic interest towards their application in the \distributed and concurrent systems" eld, but an exhaustive comparison between them is diicult because their presentations can be quite dissimi...

Article history: Received 19 November 2010 Revised 10 September 2011 Available online 19 October 2011 MSC: 34C20 34A34 16W5 68U99

We introduce a formal decomposition method for efficiently computing the parametric normal form of nonlinear dynamical systems with multiple parameters. Recently introduced notions of formal basis style and costyle are applied through formal decomposition method to obtain the simplest parametric normal form for degenerate nonlinear parametric center. The necessary formulas are derived and imple...

We consider the extension of Boolean circuits to quantified Boolean circuits by adding universal and existential quantifier nodes with semantics adopted from quantified Boolean formulas (QBF). The concept allows not only prenex representations of the form ∀x1∃y1...∀xn∃yn c where c is an ordinary Boolean circuit with inputs x1, ..., xn, y1, ..., yn. We also consider more general non-prenex norma...

The implicit operation ω is the unary operation which sends each element of a finite semigroup to the unique idempotent contained in the subsemigroup it generates. Using ω there is a well-defined algebra which is known as the free aperiodic semigroup. In this article we show that for each n, the ngenerated free aperiodic semigroup is defined by a finite list of pseudoidentities and has a decida...

Spiking neural P system is a computing device recently introduced as a bridge between spiking neural nets and membrane computing. In this paper we focus on normal forms of these systems while preserving their computational power. We show that certain combinations of existing normal forms are possible without loss of computational power, thus answering partially open problems stated in [3,8]. We...

Numerous papers were published during the last decade on the normal forms of nonlinear control systems with applications in bifurcation and its control. The approach is motivated by Poincaré’s theory of normal forms for classical dynamical systems using homogeneous transformations. In this paper, we summarize a variety of control system normal forms published in the literature so that the norma...

Abstract. Recently, a novel GHZ/W graphical calculus has been established to study and reason more intuitively about interacting quantum systems. The compositional structure of this calculus was shown to be well-equipped to sufficiently express arbitrary mutlipartite quantum states equivalent under stochastic local operations and classical communication (SLOCC). However, it is still not clear h...

Normal forms for logic programs under stable/answer set semantics are introduced. We argue that these forms can simplify the study of program properties, mainly consistency. The rst normal form, called the kernel of the program, is useful for studying existence and number of answer sets. A kernel program is composed of the atoms which are unde ned in the Well-founded semantics, which are those ...

For every algebraically closed field k of characteristic different from 2, we prove the following: (1) Generic finite dimensional (not necessarily associative) kalgebras of a fixed dimension, considered up to isomorphism, are parametrized by the values of a tuple of algebraically independent over k rational functions in the structure constants. (2) There exists an “algebraic normal form”, to wh...