Aural Pattern Recognition Experiments and the Subregular Hierarchy

Journal of Logic, Language and Information

Volumn 20, Issue 3, 2011, Pages 329-342

  Rogers, James ^a   Pullum, Geoffrey K ^b  

^a EARLHAM COLLEGE   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Artificial grammar learning; Aural pattern recognition; Cognitive complexity; Local languages; Mathematics of language; Sub regular languages

Indexed keywords

EID: 80051951866     PISSN: 09258531     EISSN: 15729583     Source Type: Journal    
DOI: 10.1007/s10849-011-9140-2     Document Type: Review

References (18)

1. Benedikt, M., & Segoufin, L. (2005). Regular tree languages definable in FO. In V. Diekert & B. Durand (Eds.), 22nd annual symposium on theoretical aspects of computer science (STACS 2005), lecture notes in computer science (Vol. 3404, pp. 327-339).
2. Bresnan J. W. (1978) Evidence for a theory of unbounded transformations. Linguistic Analysis 2: 353-393.
3. Büchi J. R. (1960) Week second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6: 66-92.
4. Chomsky, N. (1962). Context-free grammars and pushdown storage. Quarterly Progress Report 65, MIT Res. Lab. Elect.
5. Elgot C. C. (1961) Decision problems of finite automata and related arithmetics. Transactions of the American Mathematical Society 98: 21-51.
6. Fitch W. T., Hauser M. D. (2004) Computational constraints on syntactic processing in nonhuman primates. Science 303: 377-380.
7. García P., Ruiz J. (1990) Inference of k-testable languages in the strict sense and applications to syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 9: 920-925.
8. Gentner T. Q., Fenn K. M., Margoliash D., Nusbaum H. C. (2006) Recursive syntactic pattern learning by songbirds. Nature 440: 1204-1207.
9. Hauser M. D., Chomsky N., Fitch W. T. (2002) The faculty of language: What is it, who has it, and how did it evolve. Science 298: 1569-1579.
10. Heinz, J. (2007). Inductive learning of phonotactic patterns. PhD thesis, Department of Linguistics, UCLA.
11. Huybregts R. (1984) The weak inadequacy of context-free phrase structure grammars. In: Haan G. J., de Trommelen M., Zonneveld W. (eds) van Periferie Naar Kern. Foris Publications, Dordrecht, pp 81-99.
12. Lautemann C., Schwentick T., Théien D. (1994) Logics for context-free languages. In: Pacholski L., Tiuryn J. (eds) Computer science logic. Kazimierz, Poland, pp 203-216.
13. McNaughton R., Papert S. (1971) Counter-free automata. MIT Press, Cambridge.
14. Medvedev Y. T. (1964) On the class of events representable in a finite automaton. In: Moore E. F. (eds) Computer science logic. Sequential Machines-Selected Papers, Addison-Wesley, pp 215-227 originally in Russian in Avtomaty (1956), pp. 385-401.
15. Perruchet P., Rey A. (2005) Does the mastery of center-embedded linguistic structures distinguish humans from nonhuman primates?. Psychonomic Bulletin and Review 12: 307-313.
16. Shieber S. (1985) Evidence against the context-freeness of human language. Linguistics and Philosophy 8: 333-343.
17. Straubing H. (1994) Finite automata, formal logic and circuit complexity. Birkhäuser, Boston.
18. Thomas W. (1982) Classifying regular events in symbolic logic. Journal of Computer and Systems Sciences 25: 360-376.