The Use of Formal Language Theory in Studies of Artificial - CiteSeerX

Hopcroft, J. E. and J. D. Ullman1979 Introduction to Automata Theory, Languages and Computation.Addison-Wesley, Reading, Mass.Huybregts, R.1984 The weak inadequacy of context-free phrase structure grammars. InG. J. de Haan, M. Trommelen, and W. Zonneveld, eds., Van Periferie Naar Kern,pp. 81–99. Foris Publications, Dordrecht.Libkin, L.2004 Elements of Finite Model Theory. Texts in Theoretical Computer Science.Springer, Berlin/New York.McNaughton, R. and S. Papert1971 Counter-Free Automata. MIT Press, Cambridge, MA.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.Perruchet, P. and A. Rey2005 Does the mastery of center-embedded linguistic structures distinguish humansfrom nonhuman primates. Psychonomic Bulletin and Review, 12:307–373.Rogers, J. and G. K. Pullum2007 Aural pattern recognition experiments and the subregular hierarchy. InMathematics of Language 10. UCLA.Shieber, S.1985 Evidence against the context-freeness of human language. Linguisticsand Philosophy, 8:333–343.Straubing, H.1994 Finite Automata, Formal Logic and Circuit Complexity. Birkhäuser,Boston.Thatcher, J. W. and J. B. Wright1968 Generalized finite automata theory with an application to a decision problemof second-order logic. Mathematical Systems Theory, 2(1):57–81.Thomas, W.1982 Classifying regular events in symbolic logic. Journal of Computer andSystems Sciences, 25:360–376.18