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...

1.0 Introduction In this paper I will argue that there is only one true anaphor in natural language which takes many shapes. Building on the idea that some pronouns are constructed and others are 'native born' with features, as suggested in Kratzer (2009), I suggest further that, just like locally bound variables, all non-locally anteceded bound variable pronouns that are traditionally bound (c...

In this paper we approach some questions about quantum contextuality with tools from formal logic. In particular, we consider an experiment associated with the PeresMermin square. The language of all possible sequences of outcomes of the experiment is classified in the Chomsky hierarchy and seen to be a regular language. Next, we make the rather evident observation that a finite set of hidden f...

This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence of partially known input structures, symbolic evaluation of the time-bound function based on input parameters, optimizations to make the overall analysis e cient as well as accurate, and measurements of primitive param...

We examine the state complexity of proportional removals such as 1 2 (L). For 1 2 (L), we show a bound which is tight in the case that L is a unary language, and an nearly optimal bound for arbitrary languages. We also compute the average state complexity for 1 2 (L) if L is unary. We study other proportional removals and give bounds for certain reset automata.

In the paper a first order language is constructed. It includes the universal quantifier and the following propositional connectives: truth, negation, and conjunction. The variables are divided into three kinds: bound variables, fixed variables, and free variables. An infinite number of predicates for each arity is provided. Schemes of structural induction and schemes justifying definitions by ...

We study the state complexity of languages that can be obtained as reversals of regular languages represented by deterministic finite automata. We show that the state complexity of the reversal of a regular language with state complexity n is between logn and 2. We first prove that the upper bound is tight in the ternary case. Then we present binary languages reaching this upper bound on the re...

The classical Bargmann inequality 1 originates from the nonrelativistic quantummechanics and gives an upper bound for the number of bound states produced by a radially symmetric potential in the two-body system. In the subsequent papers, various proofs and reformulations of this inequality have been presented, we refer to 2, Chapter XIII , and to 3–5 for some details. In the language of singula...