The use of formal language theory in studies of artificial language learning: A proposal for distinguishing the differences between human and nonhuman animal learners

Recursion and Human Language

Volumn , Issue , 2010, Pages 213-231

  Rogers, James ^a   Hauser, Marc ^b  

^a EARLHAM COLLEGE   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79951949816     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (17)

1. Buchi, J. R. 1960 Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik,6: 66-92.
2. Elgot, C. C. 1961 Decision problems of finite automata and related arithmetics. Transactions of the American Mathematical Society, 98: 21-51.
3. Fitch, W. T. and M. D. Hauser 2004 Computational constraints on syntactic processing in nonhuman primates. Science, 303: 377-380.
4. Gentner, T. Q., K. M. Fenn, D. Margoliash, and H. C. Nusbaum 2006 Recursive syntactic pattern learning by songbirds. Nature, 440: 1204-1207.
5. Hauser, M. D., N. Chomsky, and W. T. Fitch 2002 The faculty of language: What is it, who has it and how did it evolve. Science, 298: 1569-1579.
6. Hopcroft, J. E. and J. D. Ullman 1979 Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass.
7. Huybregts, R. 1984 The weak inadequacy of context-free phrase structure grammars. In G. J. de Haan, M. Trommelen, and W. Zonneveld, eds., Van Periferie Naar Kern, pp. 81-99. Foris Publications, Dordrecht.
8. Libkin, L. 2004 Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, Berlin/New York.
9. McNaughton, R. and S. Papert 1971 Counter-Free Automata. MIT Press, Cambridge, MA.
10. Medvedev, Y. T. 1964 On the class of events representable in a finite automaton. In E. F. Moore, ed., Sequential Machines - Selected Papers, pp. 215-227. Addison-Wesley, Reading, Mass. Originally in Russian in Avtomaty (1956), pp. 385-401.
11. Perruchet, P. and A. Rey 2005 Does the mastery of center-embedded linguistic structures distinguish humans from nonhuman primates. Psychonomic Bulletin and Review, 12: 307-373.
12. Rogers, J. and G. K. Pullum 2007 Aural pattern recognition experiments and the subregular hierarchy. In Mathematics of Language 10. UCLA.
13. Shieber, S. 1985 Evidence against the context-freeness of human language. Linguistics and Philosophy, 8: 333-343.
14. Straubing, H. 1994 Finite Automata, Formal Logic and Circuit Complexity. Birk-hauser, Boston.
15. Thatcher, J. W. and J. B. Wright 1968 Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1): 57-81.
16. Thomas, W. 1982 Classifying regular events in symbolic logic. Journal of Computer and Systems Sciences, 25: 360-376.
17. Zimmerer, V. and R. Varley 2007 Recursive syntax in patients with severe agrammatism. Recursion in Human Languages, Illinois State University, Normal, Illinois.