We show that smooth global (or even semi-global) stabilizability and uniform complete observability are su cient properties to guarantee semi-global stabilizability by dynamic output feedback for continuous-time nonlinear systems.

We implement an algorithm for extracting appropriate collections of classiclike sound and complete tableau rules for a large class of finite-valued logics. Its output consists of Isabelle theories.

Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class is NP-complete.

in this research، job opportunities have been examined among 26 productive sectors of iran's economy by using input-output table in 2001.from viewpoint of employment ،production and value added، the key sectors has been diagnosed by using mri ، elasticity of input-output table، backward and forward linkages and june's corrective methods. then، job opportunities has been analyzed among...

This paper introduces a general structure that is capable of approximating input-output maps of nonlinear discrete-time systems. The structure is comprised of two stages, a dynamical stage followed by a memoryless nonlinear stage. A theorem is presented which gives a simple necessary and sufficient condition for a large set of structures of this form to be capable of modeling a wide class of no...

The problem of counting unlabelled subtrees of a tree (that is, subtrees that are distinct up to isomorphism) is #P-complete, and hence equivalent in computational difficulty to evaluating the permanent of a 0,1-matrix.

Implications of a formal context (G,M, I) have a minimal implication basis, called Duquenne-Guigues basis or stem base. It is shown that the problem of deciding whether a set of attributes is a premise of the stem base is in coNP and determining the size of the stem base is polynomially Turing equivalent to a #P-complete problem.

To compute the number of models of a 2-CF (conjunction of clauses with two literals at most), the well-known problem as #2-SAT, is a classical #P-complete problem. We show here an extensive class of instances of 2CF’s where to compute the number of models can be done