The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems

International audienceBounded languages have recently proved to be an important class of languages for the analysis of Turing-powerful models. For instance, bounded context-free languages are used to under-approximate the behav-iors of recursive programs. Ginsburg and Spanier have shown in 1966 that a bounded language L ⊆ a * 1 · · · a * d is context-free if, and only if, its Parikh image is a stratifiable semilinear set. However, the question whether a semilinear set is stratifiable, hereafter called the stratifiability problem, was left open, and remains so. In this paper, we give a partial answer to this problem. We focus on semilinear sets that are given as finite systems of linear inequalities, and we show that stratifiability is coNP-complete in this case. Then, we apply our techniques to the context-freeness problem for flat counter systems, that asks whether the trace language of a counter system intersected with a bounded regular language is context-free. As main result of the paper, we show that this problem is coNP-complete

The Green Bank Ammonia Survey: Unveiling the Dynamics of the Barnard 59 star-forming Clump

Understanding the early stages of star formation is a research field of ongoing development, both theoretically and observationally. In this context, molecular data have been continuously providing observational constraints on the gas dynamics at different excitation conditions and depths in the sources. We have investigated the Barnard 59 core, the only active site of star formation in the Pipe Nebula, to achieve a comprehensive view of the kinematic properties of the source. These information were derived by simultaneously fitting ammonia inversion transition lines (1,1) and (2,2). Our analysis unveils the imprint of protostellar feedback, such as increasing line widths, temperature and turbulent motions in our molecular data. Combined with complementary observations of dust thermal emission, we estimate that the core is gravitationally bound following a virial analysis. If the core is not contracting, another source of internal pressure, most likely the magnetic field, is supporting it against gravitational collapse and limits its star formation efficiency.Comment: 18 pages, 18 figure

Interprocedural Reachability for Flat Integer Programs

We study programs with integer data, procedure calls and arbitrary call graphs. We show that, whenever the guards and updates are given by octagonal relations, the reachability problem along control flow paths within some language w1* ... wd* over program statements is decidable in Nexptime. To achieve this upper bound, we combine a program transformation into the same class of programs but without procedures, with an Np-completeness result for the reachability problem of procedure-less programs. Besides the program, the expression w1* ... wd* is also mapped onto an expression of a similar form but this time over the transformed program statements. Several arguments involving context-free grammars and their generative process enable us to give tight bounds on the size of the resulting expression. The currently existing gap between Np-hard and Nexptime can be closed to Np-complete when a certain parameter of the analysis is assumed to be constant.Comment: 38 pages, 1 figur

The ionised, radical and molecular Milky Way: spectroscopic surveys with the SKA

Mark Thompson, et al, ‘The ionised,radical and molecular Milky Way: spectroscopic surveys with the SKA’, Proceedings, Advancing Astrophysics with the Square Kilometre Array (AASKA14): Giardini Naxos, Italy, June 9-13, 2014. © 2015 The Authors, under the Creative Commons Attribution-NonCommercial-ShareAlike CC BY-NC-SA license https://creativecommons.org/licenses/by-nc-sa/4.0/.The bandwith, sensitivity and sheer survey speed of the SKA offers unique potential for deep spectroscopic surveys of the Milky Way. Within the frequency bands available to the SKA lie many transitions that trace the ionised, radical and molecular components of the interstellar medium and which will revolutionise our understanding of many physical processes. In this chapter we describe the impact on our understanding of the Milky Way that can be achieved by spectroscopic SKA surveys, including "out of the box" early science with radio recombination lines, Phase 1 surveys of the molecular ISM using anomalous formaldehyde absorption, and full SKA surveys of ammonia inversion lines

Unary Pushdown Automata and Straight-Line Programs

We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is P-hard, equivalence and compressed membership problems are P-complete, and inclusion is coNP-complete. Our upper bounds are based on a translation theorem between udpda and straight-line programs over the binary alphabet (SLPs). We show that the characteristic sequence of any udpda can be represented as a pair of SLPs---one for the prefix, one for the lasso---that have size linear in the size of the udpda and can be computed in polynomial time. Hence, decision problems on udpda are reduced to decision problems on SLPs. Conversely, any SLP can be converted in logarithmic space into a udpda, and this forms the basis for our lower bound proofs. We show coNP-hardness of the ordered matching problem for SLPs, from which we derive coNP-hardness for inclusion. In addition, we complete the complexity landscape for unary nondeterministic pushdown automata by showing that the universality problem is $\Pi_2 \mathrm P$-hard, using a new class of integer expressions. Our techniques have applications beyond udpda. We show that our results imply $\Pi_2 \mathrm P$-completeness for a natural fragment of Presburger arithmetic and coNP lower bounds for compressed matching problems with one-character wildcards

The ionised, radical and molecular Milky Way: spectroscopic surveys with the SKA

The bandwith, sensitivity and sheer survey speed of the SKA offers unique potential for deep spectroscopic surveys of the Milky Way. Within the frequency bands available to the SKA lie many transitions that trace the ionised, radical and molecular components of the interstellar medium and which will revolutionise our understanding of many physical processes. In this chapter we describe the impact on our understanding of the Milky Way that can be achieved by spectroscopic SKA surveys, including "out of the box" early science with radio recombination lines, Phase 1 surveys of the molecular ISM using anomalous formaldehyde absorption, and full SKA surveys of ammonia inversion lines

On equations over sets of integers

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition S+T=\makeset{m+n}{m \in S, \: n \in T} and with ultimately periodic constants is exactly the class of hyper-arithmetical sets. Equations using addition only can represent every hyper-arithmetical set under a simple encoding. All hyper-arithmetical sets can also be represented by equations over sets of natural numbers equipped with union, addition and subtraction S \dotminus T=\makeset{m-n}{m \in S, \: n \in T, \: m \geqslant n}. Testing whether a given system has a solution is $\Sigma^1_1$-complete for each model. These results, in particular, settle the expressive power of the most general types of language equations, as well as equations over subsets of free groups.Comment: 12 apges, 0 figure

Lysophosphatides enhance superoxide responses of stimulated human neutrophils

Human neutrophils which are pretreated with subtoxic concentrations of a variety of lysophosphatides (lysophosphatidytcholine, lysophosphatidylcholine oleoyl, lysophosphatidylcholine myrioyl, lysophosphatidylcholine stearoyl, lysophosphatidylcholine gamma- O -hexadecyl, lysophosphatidylinositol, and lysophosphatidylglycerol) act synergistically with neutrophil agonists phorbol myristate acetate, immune complexes, poly- L -histidine, phytohemagglutinin, and N -formyl methionyl-leucyl-phenyalanine to cause enhanced generation of superoxide (O 2 − ). None of the lyso compounds by themselves caused generation of O 2 − . The lyso compounds strongly bound to the neutrophils and could not be washed away. All of the lyso compounds that collaborated with agonists to stimulate O 2 − generation were hemolytic for human red blood cells. On the other hand, lyso compounds that were nonhemolytic for red blood cells (lysophosphatidylcholine caproate, lysophosphatidylcholine decanoyl, lysophosphatidylethanolamine, lysophosphatidylserine) failed to collaborate with agonists to generate synergistic amounts of O 2 − . However, in the presence of cytochalasin B, both lysophosphatidyiethanolamine and lysophosphatidylserine also markedly enhanced O 2 − generation induced by immune complexes. O 2 − generation was also very markedly enhanced when substimulatory amounts of arachidonic acid or eicosapentanoic acid were added to PMNs in the presence of a variety of agonists. On the other hand, neither phospholipase C, streptolysin S (highly hemolytic), phospholipase A 2 , phosphatidylcholine, nor phosphatidylcholine dipalmitoyl (all nonhemolytic) had the capacity to synergize with any of the agonists tested to generate enhanced amounts of O 2 − . The data suggest that in addition to long-chain fatty acids, only those lyso compounds that possess fatty acids with more than 10 carbons and that are also highly hemolytic can cause enhanced generation of O 2 − in stimulated PMNs.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/44499/1/10753_2004_Article_BF00924787.pd