### Article

## Linear switched dynamical systems on graphs

We consider linear dynamical systems with a structure of a multigraph. The vertices are associated to linear spaces and the edges correspond to linear maps between those spaces. We analyse the asymptotic growth of trajectories (associated to paths along the multigraph), the stability and the stabilizability problems. This generalizes the classical linear switching systems and their recent extensions to Markovian systems, to systems generated by regular languages, etc. We show that an arbitrary system can be factorized into several irreducible systems on strongly connected multigraphs. For the latter systems, we prove the existence of invariant (Barabanov) multinorm and derive a method for its construction. The method works for a vast majority of systems and finds the joint spectral radius (Lyapunov exponent). Numerical examples are presented and applications to the study of fractals, attractors, and multistep methods for ODEs are discussed.

The textbook contains the basic information of formal logical systems. It is Boolean functions, Post’s theorem on functional completeness, the *k*-valued logic, derivatives of Boolean functions, axiomatic calculi for propositions, for predicates, for sequentions, for resolutions. Programming language Prolog and axiomatic programming language OBJ3 are introduced. Problems of monadic logic, of finite automata and of the represented by them languages, of temporal logic are considered. Many examples are shown. It is put in a basis of the book long-term experience of teaching by authors the discipline «Discrete mathematics» at the business informatics faculty, at the computer science faculty of National research university Higher school of economics, and at the automatics and computer technique faculty of National research university Moscow power engineering institute. The book is intended for the students of a bachelor degree, trained at the computer science faculties in the directions 09.03.01 Informatics and computational technique, 09.03.02 Informational systems and technologies, 09.03.03 Applied informatics, 09.03.04 Software Engineering, and also for IT experts and developers of software products.

We investigated conformal foliations $(M,F)$ of codimension $q\geq 3$ and proved a criterion for them to be Riemannian. In particular, the application of this criterion allowed us to proof the existence of an attractor that is a minimal set for each non-Riemannian conformal foliation. Moreover, if foliated manifold is compact then non-Riemannian conformal foliation $(M,F)$ is $(Conf(S^q),S^q)$-foliation with finitely many minimal sets. They are all attractors, and each leaf of the foliation belongs to the basin of at least one of them. The specificity of the proper conformal foliations is indicated. Special attention is given to complete conformal foliations.

In this paper a unified method for studying foliations with transversal parabolic geometry of rank one is presented.

Ideas of Fraces' paper on parabolic geometry of rank one and of works of the author on conformal foliations

are developed.

The book contains the necessary information from the algorithm theory, graph theory, combinatorics. It is considered partially recursive functions, Turing machines, some versions of the algorithms (associative calculus, the system of substitutions, grammars, Post's productions, Marcov's normal algorithms, operator algorithms). The main types of graphs are described (multigraphs, pseudographs, Eulerian graphs, Hamiltonian graphs, trees, bipartite graphs, matchings, Petri nets, planar graphs, transport nets). Some algorithms often used in practice on graphs are given. It is considered classical combinatorial configurations and their generating functions, recurrent sequences. It is put in a basis of the book long-term experience of teaching by authors the discipline «Discrete mathematics» at the business informatics faculty, at the computer science faculty* *of National Research University Higher School of Economics, and at the automatics and computer technique faculty of National research university Moscow power engineering institute. The book is intended for the students of a bachelor degree, trained at the computer science faculties in the directions 09.03.01 Informatics and computational technique, 09.03.02 Informational systems and technologies, 09.03.03 Applied informatics, 09.03.04 Software Engineering, and also for IT experts and developers of software products.

In this paper we study attractors of skew products, for which the following dichotomy is ascertained. These attractors either are not asymptotically stable or possess the following two surprising properties. The intersection of the attractor with some invariant submanifold does not coincide with the attractor of the restriction of the skew product to this submanifold but contains this restriction as a proper subset. Moreover, this intersection is thick on the submanifold, that is, both the intersection and its complement have positive relative measure. Such an intersection is called a bone, and the attractor itself is said to be bony. These attractors are studied in the space of skew products. They have the important property that, on some open subset of the space of skew products, the set of maps with such attractors is, in a certain sense, prevalent, i. e., "big." It seems plausible that attractors with such properties also form a prevalent subset in an open subset of the space of diffeomorphisms.

An attractor, in complex systems theory, is any state that is more easily or more often entered or acquired than departed or lost; attractor states therefore accumulate more members than non-attractors, other things being equal. In the context of language evolution, linguistic attractors include sounds, forms, and grammatical structures that are prone to be selected when sociolinguistics and language contact make it possible for speakers to choose between competing forms. The reasons why an element is an attractor are linguistic (auditory salience, ease of processing, paradigm structure, etc.), but the factors that make selection possible and propagate selected items through the speech community are non-linguistic. This paper uses the consonants in personal pronouns to show what makes for an attractor and how selection and diffusion work, then presents a survey of several language families and areas showing that the derivational morphology of pairs of verbs like fear and frighten, or Turkish korkmak 'fear, be afraid' and korkutmak 'frighten, scare', or Finnish istua 'sit' and istutta 'seat (someone)', or Spanish sentarse 'sit down' and sentar 'seat (someone)' is susceptible to selection. Specifically, the Turkish and Finnish pattern, where 'seat' is derived from 'sit' by addition of a suffix-is an attractor and a favored target of selection. This selection occurs chiefly in sociolinguistic contexts of what is defined here as linguistic symbiosis, where languages mingle in speech, which in turn is favored by certain demographic, sociocultural, and environmental factors here termed frontier conditions. Evidence is surveyed from northern Eurasia, the Caucasus, North and Central America, and the Pacific and from both modern and ancient languages to raise the hypothesis that frontier conditions and symbiosis favor causativization.

This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.

Many electronic devices operate in a cyclic mode. This should be considered when forecastingreliability indicators at the design stage.The accuracy of the prediction and the planning for the event to ensure reliability depends on correctness of valuation and accounting greatest possiblenumber of factors. That in turn will affect the overall progress of the design and, in the end,result in the quality and competitiveness of products