The communication structure of parallel communicating grammar systems (PCGS) considered as the descriptional complexity of PCGS is investigated here. The aim of the paper is to compare computational power of PCGS’s with respect to their communication structure. Investigating the generation of the languages over one-letter alphabet the communication structures dags(directed acyclic graphs) and c...

We prove that the set of properties describable by a uniform sequence of rst-order sentences using at most k + 1 distinct variables is exactly equal to the set of properties checkable by a Turing machine in DSPACEn k ] (where n is the size of the universe). This set is also equal to the set of properties describable using an iterative deenition for a nite set of relations of arity k. This is a ...

In his book, Analytical Archaeology, Clarke (1968:512-513) noted three ways in which mathematical concepts are relevant to what he calls archaeological ideology: "(i) The need for entitation and quantification ... using ... descriptive statistics"; "(ii) The need to handle relationship concepts ... using analytical inductive statistics"; "(iii) The need to handle the regularities in complex dat...

In this position paper we briefly review the development history of automated inductive theorem proving and computer-assisted mathematical induction. We think that the current low expectations on progress in this field result from a faulty narrow-scope historical projection. Our main motivation is to explain — on an abstract but hopefully sufficiently descriptive level — why we believe that fut...

A new distance function dist (A,B) for fuzzy sets A and B is introduced. It is based on the descriptive complexity, i.e., the number of bits (on average) that are needed to describe an element in the symmetric difference of the two sets. The distance gives the amount of additional information needed to describe any one of the two sets given the other. We prove its mathematical properties and pe...

In this position paper we briefly review the development history of automated inductive theorem proving and computer-assisted mathematical induction. We think that the current low expectations on progress in this field result from a faulty narrow-scope historical projection. Our main motivation is to explain—on an abstract but hopefully sufficiently descriptive level—why we believe that future ...

Two patients with vitelliform macular lesions, normal EOG Arden ratios, and no family history of Best's vitelliform dystrophy are presented. Their findings are compared with those in 10 similar reported cases, and a common, nongenetic aetiology is suggested for all. The several names given to this identical fundus picture by different authors are examined and are seen to be inappropriate. A com...

A constructive framework of recent work in the semantics of programming languages is offered. The criticism is directed not so much at the techniques and results obtained as at the use to which they are put. The fact that denotational (or “mathematical”) semantics plays on the whole a passive (“descriptive”) rôle, while operational semantics plays on the whole an active (“prescriptive”) rôle, i...

In this research work, we have developed a bio inspired PSO algorithm in combination with descriptive statistics equation based model. In this work, based on the mathematical relationship between the Entropy, Uniformity and the threshold measured in terms of intensity. It is found using box plot and curve fitting techniques to calculate automatic input threshold for PSO. The results show highly...