Skip to main navigation Skip to search Skip to main content

Cognitive and sub-regular complexity

  • James Rogers
  • , Jeffrey Heinz
  • , Margaret Fero
  • , Jeremy Hurst
  • , Dakotah Lambert
  • , Sean Wibel
  • Earlham College

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

54 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationFormal Grammar - 18th International Conference, FG 2013, Proceedings
Pages90-108
Number of pages19
DOIs
StatePublished - 2013
Event18th International Conference on Formal Grammar, FG 2013 - Dusseldorf, Germany
Duration: Aug 10 2013Aug 11 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8036 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Conference on Formal Grammar, FG 2013
Country/TerritoryGermany
CityDusseldorf
Period08/10/1308/11/13

Keywords

  • Cognitive complexity
  • descriptive complexity
  • phonological stress
  • sub-regular hierarchy

Fingerprint

Dive into the research topics of 'Cognitive and sub-regular complexity'. Together they form a unique fingerprint.

Cite this