Modern semiotics is a branch of logics that formally defines symbol-based communication. In recent years, the semiotic classification of signs has been invoked to support the notion that symbols are uniquely human. Here we show that alarm-calls such as those used by African vervet monkeys (Cercopithecus aethiops), logically satisfy the semiotic definition of symbol. We also show that the acquis...

Objectives: The aim of the present study was to assess the auditory lateralization ability in children with (central) auditory processing disorder. Methods: Participants were divided in two groups: 15 children with Central Auditory Processing Disorder (8-10 years) and 80 normal children (8-11 years) from both genders with pure-tone air-conduction thresholds better than 20 dB HL bilaterally a...

symbol is a term. a term or an index which has some paradoxical meanings, in addition to its conventional meaning. symbols are not innovated, they come from human's creative dreams and imaginations and they show unknown things.old men didn't think about their symbols, they lived with them. so we, as interpreters of dreams, should pay attention not only to the symbol by itself, but als...

objectives: the aim of the present study was to assess the auditory lateralization ability in children with (central) auditory processing disorder. methods: participants were divided in two groups: 15 children with central auditory processing disorder (8-10 years) and 80 normal children (8-11 years) from both genders with pure-tone air-conduction thresholds better than 20 db hl bilaterally and ...

Objectives: This study investigated the efficacy of working memory training for improving working memory capacity and related auditory stream segregation in auditory processing disorders children. Methods: Fifteen subjects (9-11 years), clinically diagnosed with auditory processing disorder participated in this non-randomized case-controlled trial. Working memory abilities and auditory strea...

The set E of strings is said to be definable (strongly definable) if there is a context-free grammar G such that E is the set of all terminal strings generated from the initial symbol (from all non­ terminal symbols) of G. The classification of definable and strongly definable sets in dependence on minimal number of nonterminal symbols needed for their generation is given.

We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified righthand-side nonterminal (the head) and add the remaining nonterminals one at a time in any order. We show that it is NP-hard to find the best head-driven strategy in terms of either the time or space complexity of parsing.