We investigate regular realizability (RR) problems, which are the problems of verifying whether the intersection of a regular language – the input of the problem – and a fixed language, called a filter, is non-empty. In this paper we focus on the case of context-free filters. The algorithmic complexity of the RR problem is a very coarse measure of the complexity of context-free languages. This ...

Networks with dependency links are more vulnerable when facing the attacks. Recent research also has demonstrated that the interdependent groups support the spreading of cooperation. We study the prisoner's dilemma games on spatial networks with dependency links, in which a fraction of individual pairs is selected to depend on each other. The dependency individuals can gain an extra payoff whos...

Shuffle projection is motivated by the verification of safety properties of special parameterized systems. Basic definitions and properties, especially related to alphabetic homomorphisms, are presented. The relation between iterated shuffle products and shuffle projections is shown. A special class of multi-counter automata is introduced, to formulate shuffle projection in terms of computation...

Understanding of tissue growth is in its nature multidisciplinary, since it varies from cancer diagnostics, image processing, fractal analysis to regular and non-regular heat flows. By medical sciences it was requested to better understood the tissue grow relation to mathematical modelling (stochastic geometry, fractal growth, diffusions). It is clear, that deterministic fractal is not an appro...

? Abstract. This paper generalizes the Huet and L evy theory of normaliza-tion by neededness to an abstract setting. We deene Stable Deterministic Residual Structures (SDRS) and Deterministic Family Structures (DFS) by axiomatizing some properties of the residual relation and the family relation on redexes in an Abstract Rewriting System. We present two proofs of the Relative Normalization Theo...

We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we introduce regular, pseudo-regular, and almost regular matrices. Nonnegative, symmetric, almost regular matrices were studied earlier by Ho¤man, Wolfe, and Ho¤...

In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as efficiently as possible. We study under what conditions and what cost a team of mobile agents can do this in synchronous arbitrary regular graphs using the breadth-first-search strategy. Due to the nature of the exper...

The present investigation evaluated whether anxiety sensitivity interacted with marijuana use in relation to the prediction of panic-relevant variables among young adult tobacco smokers (n=265). Approximately 73% of the sample was composed of current marijuana smokers, with 78.5% of this sub-sample using marijuana more than once per week. As expected, after covarying cigarettes per day, alcohol...

We describe a new and more efficient algorithm for checking universality and language inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the best of our knowledge, the antichain-based approach proposed by De Wulf et al. was the most efficient one so far. Our idea is to exploit a simulation relation on the states of finite automata to accelerate the antichain-bas...

This presentation is a generalization of 8] from square, regular n-by-n, pencils to singular and rectangular m-by-n pencils. We deene arithmetic-like operations on matrix pencils that are a natural extension of sums, products and quotients of real numbers. The algebra of linear transformations may be regarded as a special case of this pencil arithmetic. The language of linear relations leads to...