-
Articles citing this article
-
Same authors
- Recommend this article
- Download citation
- Alert me if this article is cited
- Alert me if this article is corrected
|
|||||||||||||||
DOI: 10.1051/ita:2001105
Theoret. Informatics Appl. 35, 453-475 (2001)
Linear size test sets for certain commutative languages
Stepán Holub and Juha KortelainenTurku Centre for Computer Science & Charles University, Prague, Czech Republic Department of Information Processing Science, University of Oulu, P.O. Box 3000, 90014 Oulun Yliopisto, Finland.
(Received April, 2001. Accepted December, 2001)
Abstract
We prove that for each positive integer
n, the finite commutative language
possesses a test set of size at most
5n. Moreover, it is shown that each test set for
En has at least
n-1 elements. The result is then generalized to commutative languages
L containing a word
w such that (i)
and
(ii) each symbol
occurs at least twice in
w if it occurs at least twice in some word of
L: each such
L possesses a test set of size
11n, where
. The considerations rest on the analysis of some basic types of word equations.
Mathematics Subject Classification. 68R15.
© EDP Sciences 2001
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook