Abstract
Using a symbolic dynamics and a surrogate data approach, we show that the language exhibited by common fruit flies Drosophila (‘D.’) during courtship is as grammatically complex as the most complex human-spoken modern languages. This finding emerges from the study of fifty high-speed courtship videos (generally of several minutes duration) that were visually frame-by-frame dissected into 37 fundamental behavioral elements. From the symbolic dynamics of these elements, the courtship-generating language was determined with extreme confidence (significance level > 0.95). The languages categorization in terms of position in Chomsky’s hierarchical language classification allows to compare Drosophila’s body language not only with computer’s compiler languages, but also with human-spoken languages. Drosophila’s body language emerges to be at least as powerful as the languages spoken by humans.
Highlights
Over the centuries, the evolution of human language has been the subject of controversial discussions among philosophers, linguists and biologists
In order to study the evolution of language and to determine its driving forces, Chomsky and Schutzenberger [7] proposed a hierarchical classification scheme, comprising grammars of increasing grammatical complexities: t-3 5c t-2 5 t-1 5 t-0 (Turing machine), able to account for the changes undergone
This classification approach has been used to compare spoken human languages, for distinguishing compiler languages, as a basis for the theory of automata, and for classifying dynamical systems [8]. We apply this widely accepted classification scheme to the precopulatory dance of Drosophila melanogaster, where we show, by combining a nonlinear symbolic dynamics with a surrogate data analysis approach, that the dance of this fly is generally of complexity t-1: It is as, or even more, grammatically complex as the Dutch or the Swiss-German [9], the most complex spoken western languages
Summary
The evolution of human language has been the subject of controversial discussions among philosophers, linguists and biologists. In order to study the evolution of language and to determine its driving forces, Chomsky and Schutzenberger [7] proposed a hierarchical classification scheme, comprising grammars of increasing grammatical complexities: t-3 (left regular grammar) 5c t-2 (context free grammar) 5 t-1 (context sensitive grammar) 5 t-0 (Turing machine), able to account for the changes undergone. This classification approach has been used to compare spoken human languages, for distinguishing compiler languages, as a basis for the theory of automata, and for classifying dynamical systems [8]. Note that our general approach could be applied to other taxonometries of language characterization
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
