A regular language is k-piecewise testable if it is a finite boolean combination of languages of the form Σa1Σ · · ·ΣanΣ, where ai ∈ Σ and 0 ≤ n ≤ k. Given a DFA A and k ≥ 0, it is an NLcomplete problem to decide whether the language L(A) is piecewise testable and, for k ≥ 4, it is coNP-complete to decide whether the language L(A) is k-piecewise testable. It is known that the depth of the minim...

We present a new method for computing upper bounds for an optimization version of the E-MAJSAT problem. This new approach is based on the use of the compilation language d-DNNF that underlies several state-of-the-art algorithms for solving problems related to EMAJSAT. We show that the new bound values dominate those produced by the standard algorithm based on the same approach. Moreover, we pre...

For n-regular, N-vertex bipartite graphs with bipartition A ∪ B, a precise bound is given for the sum over independent sets I of the quantity μ|I∩A|λ|I∩B|. (In other language, this is bounding the partition function for certain instances of the hard-core model.) This result is then extended to graded partially ordered sets, which in particular provides a simple proof of a well-known bound for D...

For self-dual codes with all weights divisible by an integer greater than one, the minimum distance is bounded by the Mallows-Sloane upper bounds and by their improvements due to Krasikov-Litsyn and Rains. We obtain the improved upper bounds from short relations with constant coefficients on suitable binomial moments of the codes. In this approach, the Mallows-Sloane bounds are analogues of the...

Although the Japanese reflexive zibun can be bound both locally and across clause boundaries, third-person pronoun kare cannot take a local antecedent. These are properties that children need to learn about their language, but we show direct evidence of binding possibilities is sparse absent in speech children, leading us ask children’s knowledge. We unlike adults, incorrectly reject long-dista...

In this paper we prove a tight log n lower bound on the product of strong space and input head reversals for any Turing machine (equipped with a read only input tape) accepting a nonregular language.

In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.

this study was carried out to examine aflatoxin b1 (afb1) removal ability of four strains of lactic acidbacteria (lab). three indigenous (lactobacillus rhamnosus tmu094, lactobacillus fermentum tmu121and pedioccus pentosaceus tmu457) and a non-indigenous (labacillus rhamnosus ptcc1637) isolateswere studied. the strains were incubated with (afb1) at different time. the toxin residual in the supe...

We show how P automata having a finite description and working with a finite object-alphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized by different types of P automata to some of the existing characterizations of language classes over infinite alphabets, and give an upper bound for the class of languages accepted...

From the models provided in [14] and [4] for the semantics of Java and C] programs we abstract the mathematical structure that underlies the semantics of both languages. The resulting model reveals the kernel of object-oriented programming language constructs and can be used for teaching them without being bound to a particular language. It also allows us to identify precisely some of the major...