Rational approximations of polynomial factorial languages / Shur Arseny M. // INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. - 2007. - V. 18, l. 3. - P. 655-665.

ISSN/EISSN:

0129-0541 / нет данных

Type:

Article

Abstract:

We approximate factorial languages by languages with finite antidictionaries. Let s and m be positive integers with s <= m. We construct a language of complexity Theta (n(m)), and a sequence of languages with finite antidictionaries, each of those having the complexity Theta(n(m)), such that this sequence converges to the original language.

Author keywords:

WORDS

DOI:

10.1142/S0129054107004887

Web of Science ID:

ISI:000251155900013

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	JUN
Publisher	WORLD SCIENTIFIC PUBL CO PTE LTD
Address	5 TOH TUCK LINK, SINGAPORE 596224, SINGAPORE
Language	English
Keywords-Plus	WORDS
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Theory \& Methods
Author-Email	Arseny.Shur@usu.ru
Number-of-Cited-References	8
Journal-ISO	Int. J. Found. Comput. Sci.
Doc-Delivery-Number	234IY