Context-free languages of sub-exponential growth
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 use...
| Главные авторы: | , |
|---|---|
| Формат: | Journal article |
| Язык: | English |
| Опубликовано: |
Elsevier
2002
|