Introduction. Infinite two-player games on graphs are a powerful tool to model, verify, and synthesize open reactive systems and are closely related to fixed-point logics. The winner of a play in such a game typically emerges only after completing the whole (infinite) play. Despite this, McNaughton became interested in playing infinite games in finite time, motivated by his belief that “infinit...

We obtain a family of supersymmetric solutions of type IIB supergravity with dynamic SU(2) structure, which describe the local geometry near a stack of four D7-branes and one O7-plane wrapping a rigid four-cycle. The deformation to a generalized complex geometry is interpreted as a consequence of nonperturbative effects in the seven-brane gauge theory. We formulate the problem for seven-branes ...

For a K3 surface X and its bounded derived category of coherent sheaves D(X), we have the notion of stability conditions on D(X) in the sense of T.Bridgeland. In this paper, we show that the moduli stack of semistable objects in D(X) with a fixed numerical class and a phase is represented by an Artin stack of finite type over C. Then following D.Joyce’s work, we introduce the invariants countin...

The first implementation of new E6 stack of networking protocols within the kernel of an operating system is presented. Stack E6 was developed to increase the efficiency of a network entirely built on the base of Ethernet technology. It uses a uniform hierarchical E6 address on all the levels and annuls TCP, UDP and IP protocols. The experimental implementation adds a new system call to the ker...

A subclass of the LR(O)-grammars, the class of simple chain grammars is introduced. Although there exist simpio chain grammars which are not LL(k) for any k > 0, this new class of grammars is very closely related to the LL(1) and simple LL(1) grammars. In fact it can be shown that every simple chain grammar has an equivalent simple LL(1) grammar. Cover properties for simple chain grammars are i...

We prove that the multivariate zeta function of a sofic-Dyck shift is the commutative series of some visibly pushdown language. As a consequence the zeta function of a sofic-Dyck shift is the generating function of a visibly pushdown language and is thus an N-algebraic series.

A new pushdown automata based algorithm for searching all occurrences of a tree pattern in a subject tree is presented. The algorithm allows pattern matching with don’t care symbols and multiple patterns. A simulation algorithm is also proposed, and practical experimental results are presented.

We show that several basic discounted properties of probabilistic pushdown automata related both to terminating and non-terminating runs can be efficiently approximated up to an arbitrarily small given precision.

We analyze models of infinite-state automata extended by monotonic counting mechanisms, starting from the (finite-state) Parikh automata studied by Klaedtke and Rueß. We show that, for linearbounded automata, this extension does not increase the language recognition power. In the framework of infinite transition systems developed by Caucal and others, we show that adding monotonic counters to s...