Services
-
Same authors
-
Related articles
- Recommend this article
- Download citation
- Alert me if this article is cited
- Alert me if this article is corrected
|
||||||||||||||||||
RAIRO-Theor. Inf. Appl. 42, 525-537 (2008)
DOI: 10.1051/ita:2008011
Parikh test sets for commutative languages
Stepán HolubCharles University, Faculty of Mathematics and Physics, Department of Algebra, Sokolovská 83, 175 86 Praha, Czech Republic; holub@karlin.mff.cuni.cz
Published online: 3 June 2008
Abstract
A set
is a Parikh test set of L if
c(T) is a test set of c(L).
We give a characterization of Parikh test sets for arbitrary language in terms of its Parikh basis, and the coincidence graph of letters.
Mathematics Subject Classification. 68R15
Key words: Combinatorics on words -- test sets -- commutative languages.
© EDP Sciences 2008
| What is OpenURL? |
The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access. An OpenURL link contains article metadata and directs it to the OpenURL server of your choice. The OpenURL server can provide access to the resource and also offer complementary services (specific search engine, export of references...). The OpenURL link can be generated by different means.
- 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