Document
Services
-
Same authors
-
Related articles
- Recommend this article
- Download citation
- Alert me if this article is cited
- Alert me if this article is corrected
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook
|
||||||||||||||||||
RAIRO-Theor. Inf. Appl. 43, 269-279 (2009)
DOI: 10.1051/ita:2008028
Polynomial languages with finite antidictionaries
Arseny M. ShurUral State University, Ekaterinburg, Russia; Arseny.Shur@usu.ru
Received January 20, 2006. Accepted October 14, 2008. Published online 22 November 2008
Abstract
We tackle the problem of studying which kind of functions can occur as complexity functions of formal languages of a certain type. We prove that an important narrow subclass of rational languages contains languages of polynomial complexity of any integer degree over any non-trivial alphabet.
Mathematics Subject Classification. 68Q45, 68R15.
Key words: Regular language -- finite antidictionary -- combinatorial complexity -- wed-like automaton
© 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.