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:
-
-
(Preview, Version of record, pdf, 64.9KB, Terms of use)
-
- Publisher copy:
- 10.1006/jcss.2001.1804
Authors
+ Engineering and Physical Sciences Research Council
More from this funder
- Funding agency for:
- Bridson, M
- 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
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2002
- Notes:
- Copyright 2002 Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
- Licence:
- Other
If you are the owner of this record, you can report an update to it here: Report update to this record