We prove two results on interactive proof systems with 2-way probabilistic finite state verifiers. The first is a lower bound on the power of such proof systems, if they are not required to halt with high probability on rejected inputs: we show that they can accept any recursively enumerable language. The second is an upper bound on the power of interactive proof systems that halt with high pro...

1. RECAPITULATION Part I of this article treats tense in relative clauses (RCs) in English, Russian and Japanese. The temporal centre in RCs can always be Tproi, and sometimes it has to be Tproi. 1. In SOT languages such as English, the Tense in the RC is bound in RC\wollconfigurations, i.e., we find a Tproi bound by woll. The licensing of the morphological tense in the RC is non-local in these...

Complementing ω-automata is a crucial instrument for solving the ω-language containment problem, and therefore it has numerous applications in formal language theory, program analysis and modelchecking. There have been great interests in determining the exact complexity of the complementation problem. However, obtaining nontrivial lower bounds for the complementation problem has been difficult....

Despite the overwhelming use of statistical language models in speech recognition, machine translation, and several other domains, few high probability guarantees exist on their generalization error. In this paper, we bound the test set perplexity of two popular language models – the n-gram model and class-based n-grams – using PAC-Bayesian theorems for unsupervised learning. We extend the boun...

Rice’s Theorem states that all nontrivial language properties of recursively enumerable sets are undecidable. Borchert and Stephan [BS00] started the search for complexity-theoretic analogs of Rice’s Theorem, and proved that every nontrivial counting property of boolean circuits is UP-hard. Hemaspaandra and Rothe [HR00] improved the UP-hardness lower bound to UPO(1)-hardness. The present paper ...

A Forensic Lucid intensional programming language has been proposed for intensional cyberforensic analysis. In large part, the language is based on various predecessor and codecessor Lucid dialects bound by the higher-order intensional logic (HOIL) that is behind them. This work formally specifies the operational aspects of the Forensic Lucid language and compiles a theory of its constructs usi...

cellular manufacturing system (cms) is highly important in modern manufacturing methods. given the ever increasing market competition in terms of time and cost of manufacturing, we need models to decrease the cost and time of manufacturing. in this study, cms is considered in condition of dynamic demand in each period. the model is developed for facing dynamic demand that increases the cost of ...

We present a simple computational approach to assigning a measure of complexity and information/entropy to families of natural languages, based on syntactic parameters and the theory of error correcting codes. We associate to each language a binary string of syntactic parameters and to a language family a binary code, with code words the binary string associated to each language. We then evalua...