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...

詳細記述

書誌詳細
主要な著者: Bridson, M, Gilman, R
フォーマット: Journal article
言語:English
出版事項: Elsevier 2002

類似資料