Two ISO standard methods for in-stack sampling and measurement of PM2.5 and PM10 mass concentrations in flue gas from stationary sources were published in 2009 (ISO 23210, conventional cascade impactors) and 2012 (ISO 13271, virtual impactors). The performances of these two methods in terms of PM2.5 separation efficiency and the accuracy of measured mass concentration were compared at the same ...

We examine the one-humped map at the period-doubling transition to chaos, and ask whether its long-term memory is stack-like (last-in, first-out) or queue-like (first-in, first-out). We show that it can be recognized by a real-time automaton with one queue, or two stacks, and give several new grammatical characterizations of it. We argue that its memory has a queue-like character, since a singl...

The important distinction between parameterized specifications and specifications of parameterized programs has been originally pointed out in [12]. An important difference concerns the objects which the two kinds of parameterization allow one to reuse. A parameterized specification, “PSP”, e.g., of stacks parameterized by elements, Stack(El), allows one, under some conditions, to instantiate t...

In this paper we examine a new class of languages defined by Alur and Madhusudan called visibly pushdown languages and use them to study the word problem for finitely generated groups.

We first give an improved lower bound for the deterministic onlinesimulation of tapes or pushdown stores by queues. Then we inspect some proofs in a classical work on queue machines in the area of Formal Languages and outline why a main argument in the proofs is incomplete.

We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete in the Borel hierarchy. This was the first example of a decidable winning condition of such Borel complexity. We extend this result by giving a family of decidable winning conditions of arbitrary finite Borel complexity....

We prove that the class of the classifying stack BPGLn is the multiplicative inverse of the class of the projective linear group PGLn in the Grothendieck ring of stacks K0(Stackk) for n = 2 and n = 3 under mild conditions on the base field k. In particular, although it is known that the multiplicativity relation {T} = {S} · {PGLn} does not hold for all PGLntorsors T → S, it holds for the univer...