Journal article icon

Journal article

Context-free languages of sub-exponential growth

Abstract:
Context-free languages of sub-exponential growth were studied. The growth function was defined as the function whose value at each non-negative integer was the number of words of length n in a fixed formal language. The definition of a bounded language, which is a subset for some words, was also used in the analysis. Results showed that context-free languages of intermediate growth were nonexistent.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Files:
Publisher copy:
10.1006/jcss.2001.1804

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Author


Publisher:
Elsevier
Journal:
Journal of Computer and System Sciences More from this journal
Volume:
64
Issue:
2
Pages:
308-310
Publication date:
2002-01-01
DOI:
ISSN:
0022-0000


Language:
English
Keywords:
Pubs id:
9368
UUID:
uuid:d55e36d5-2cce-4de7-af0b-7fa20d8883ba
Local pid:
pubs:9368
Source identifiers:
9368
Deposit date:
2012-12-19
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP