Language Complexity

[Everett, Daniel]

In the following paper that I posted recently to LingBuzz (http://ling.auf.net/lingbuzz/@uzQLvqVFGomVJRWR/aCpQCltn?253), one of the points I try to make is that a language can be non-finite with a finite grammar, something that I believe has been largely overlooked via attempts to reduce discussions of language complexity to sentence grammars.

If anyone is inclined to read that paper and knows of any similar examples, I would be pleased to learn of them.

Sincerely,

Dan Everett




*************************
Daniel L. Everett
Dean of Arts and Sciences
308 Morison Hall
Bentley University
175 Forest Street
Waltham, MA 02452
Office Phone: 781-891-2131
Fax: 781-891-2125
http://www.bentley.edu/index.cfm
http://www.bentley.edu/mission-focus/deanas.cfm

http://daneverettbooks.com/