A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is shorter. The proof idea is to restate the problem in Presburger arithmetic. A language L ⊆ A * is called locally threshold testable (LTT) if it is a Boolean combination of languages of the form: a) words that have w ∈ A ...

introduction. in the current screening system, new admissions are based on general intelligence as measured by universities entrance examination. considering the fact that an important function of medical graduates is to educate the patients how to restore and take care of their health, communicative competence and skills would be, at least, as important as general intelligence. to show that la...

objectives: language development is often very slower in hearing impaired children compared with their normal peers. hearing impairment during childhood affects all aspects of speech production and language acquisition. it seems that hearing impaired people suffer from language and speech impairments such as production of complex linguistic structures. the purpose of this study is to determine ...

To prove that a pattern p is avoidable on a given alphabet, one has to construct an innnite language L that avoids p. Usually, L is a DOL-language (obtained by iterating a morphism h) or a HDOL-language (obtained by coding a DOL-language with another morphism g). Our purpose is to nd an algorithm to test, given a HDOL-system G, whether the language L(G) generated by this system avoids p. We rst...

Using natural language to write programs is a touchstone problem for computational linguistics. We present an approach that learns to map natural-language descriptions of simple “if-then” rules to executable code. By training and testing on a large corpus of naturally-occurring programs (called “recipes”) and their natural language descriptions, we demonstrate the ability to effectively map lan...

Abstract. We examine the issue of stability of probability in reasoning about complex systems with uncertainty in structure. Normally, propositions are viewed as probability functions on an abstract random graph where it is implicitly assumed that the nodes of the graph have stable properties. But what if some of the nodes change their characteristics? This is a situation that cannot be covered...

While it is known that every closed orientable 3-manifold M contains an arithmetic link L (since the figure-eight knot complement is both arithmetic and universal), Theorem 2 asserts that L can be chosen so that M \ L is homeomorphic to the complement of a link in S3. Recall that a link L in S3 (resp. in M) is hyperbolic if S3 \L (resp. M \L) is homeomorphic to H3/Γ, where H3 is hyperbolic 3-sp...

Each Emergency Medical Assistance Centre in France (SAMU), includes an emergency call service. It provides an adequate and immediate response to medical problems. The processing of the incoming calls can be seen as a collaborative process involving several stakeholders. The control of such a process is crucial. Indeed, the effectiveness of the response to these incoming calls strongly impacts t...

It is a widely accepted doctrine in epistemology that knowledge has greater value than mere true belief. But although epistemologists regularly pay homage to this doctrine, evidence for it is shaky. Is it based on evidence that ordinary people on the street make evaluative comparisons of knowledge and true belief, and consistently rate the former ahead of the latter? Do they reveal such a prefe...