RNA molecules are sequences of nucleotides that serve as more than mere intermediaries between DNA and proteins, e.g., as catalytic molecules. Computational prediction of RNA secondary structure is among the few structure prediction problems that can be solved satisfactorily in polynomial time. Most work has been done to predict structures that do not contain pseudoknots. Allowing pseudoknots i...

Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5), thus improving the previously known complexity O(n8polylog(n)). It also improves the previously known complexity O(n6polylog(n)) of the equality problem for simple grammars. Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.1

This paper shows that linear time μ-calculus with sequential composition defines exactly those properties that are expressible with alternating context-free grammars for ω-words. This helps to understand the expressive power of modal μ-calculus with a chop operator and provides a logical characterisation of the class of alternating context-free languages.

Thermal activation is mediated by field configurations that correspond to saddle points of the energy functional. The rate of probability flow along the unstable functional directions, i.e the activation rate, is usually obtained from the imaginary part of a suitable analytic continuation of the equilibrium free energy. In this note we provide a real-time, non-equilibrium interpretation of this...

We deduce an overcomplete free energy functional for D=1 particle systems with next neighbor interactions, where the set of redundant variables are the local block densities +i of i interacting particles. The idea is to analyze the decomposition of a given pure system into blocks of i interacting particles by means of a mapping onto a hard rod mixture. This mapping uses the local activity of co...

A polynomial-time procedure is presented for deciding bisimilarity of normed context-free processes. It follows as a corollary that language equivalence of simple context-free grammars is decidable in polynomial time.

Thermogravimetric studies of chitin and chitosan in air atmosphere were carried out at six rates of linear increase of the temperature. The kinetics and mechanism of the thermal decomposition reaction were evaluated from the TG data using recommended from ICTAC kinetics committee isoconversional calculation procedure of Kissinger-Akahira-Sunose, as well as 27 mechanism functions. The values of ...

Bilexical context-free grammars (2-LCFGs) have proved to be accurate models for statistical natural language parsing. Existing dynamic programming algorithms used to parse sentences under these models have running time of O(|w|4), where w is the input string. A 2-LCFG is splittable if the left arguments of a lexical head are always independent of the right arguments, and vice versa. When a 2-LC...

We study context-free grammars whose generated language is bounded (that is, subset of some expression w ̊ 1 . . . w ̊ d called bounded expression). We investigate the underlying generating process of such language and show that there exists a bounded expression u1 . . . um over the production rules, such that the language is generated only by sequences of production rules conforming to the bound...

We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as hard as parsing an unrestricted context free grammar. We also consider the class of linear grammars and give a propagator that runs in quadratic time. Finally, ...