Cognitive and Sub-regular Complexity

We present a measure of cognitive complexity for subclasses of the regular languages that is based on model-theoretic complexity rather than on description length of particular classes of grammars or automata. Unlike description length approaches, this complexity measure is independent of the implementation details of the cognitive mechanism. Hence, it provides a basis for making inferences about cognitive mechanisms that are valid regardless of how those mechanisms are actually realized.

[1]  Rob Goedemans,et al.  A survey of word accentual patterns in the languages of the world , 2010 .

[2]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[3]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[4]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[5]  Pedro Garc ´ õa.  Learning k-Testable and k-Piecewise Testable Languages from Positive Data , 2004 .

[6]  Noam Chomsky,et al.  The faculty of language: what is it, who has it, and how did it evolve? , 2002, Science.

[7]  Wolfgang Thomas,et al.  Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[8]  James Rogers,et al.  On Languages Piecewise Testable in the Strict Sense , 2007, MOL.

[9]  Jeffrey Heinz,et al.  Inductive learning of phonotactic patterns , 2007 .

[10]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[11]  T. Graf.  Comparing Incomparable Frameworks: A Model Theoretic Approach to Phonology , 2010 .

[12]  B. Hayes.  Metrical Stress Theory: Principles and Case Studies , 1995 .

[13]  Marcus Kracht,et al.  The mathematics of language , 2003 .

[14]  Enrique Vidal,et al.  Learning Locally Testable Languages in the Strict Sense , 1990, ALT.

[15]  Jeffrey Heinz,et al.  Sentence and Word Complexity , 2011, Science.

[16]  Larry M. Hyman.  DRAFTTo be submitted to Language Sciences How (not) to do Phonological Typology: The Case of Pitch-Accent , 2009 .

[17]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[18]  A Pettorossi.  Automata theory and formal languages , 2008 .

[19]  Imre Simon,et al.  Piecewise testable events , 1975, Automata Theory and Formal Languages.

[20]  Karl Magnus Petersson,et al.  Artificial Language Learning in Adults and Children , 2010 .

[21]  Jeffrey Heinz.  Learning Long-Distance Phonotactics , 2010, Linguistic Inquiry.

[22]  Jeffrey Heinz.  On the role of locality in learning stress patterns* , 2009, Phonology.

[23]  Thomas Graf.  Locality and the Complexity of Minimalist Derivation Tree Languages , 2011, FG.

[24]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[25]  Molly Visscher,et al.  Deciding Strictly Local ( SL ) Languages , 2008 .