Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/111773
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShur, A. M.en
dc.date.accessioned2022-05-12T08:22:44Z-
dc.date.available2022-05-12T08:22:44Z-
dc.date.issued2009-
dc.identifier.citationShur A. M. On intermediate Factorial Languages / A. M. Shur // Discrete Applied Mathematics. — 2009. — Vol. 157. — Iss. 7. — P. 1669-1675.en
dc.identifier.issn0166-218X-
dc.identifier.otherAll Open Access, Bronze3
dc.identifier.urihttp://hdl.handle.net/10995/111773-
dc.description.abstractWe prove that factorial languages defined over non-trivial finite alphabets under some natural conditions have intermediate complexity functions, i.e., the number of words in such a language grows faster than any polynomial but slower than any exponential function. © 2008 Elsevier B.V. All rights reserved.en
dc.description.sponsorshipThe author is grateful to J. Karhumäki for valuable remarks on the paper. The author was supported by the Federal Science and Innovation Agency of Russia under the grants RI-111. 0/002/075 and 2227.2003.01, by the Russian Foundation for Basic Research under the grant 05-01-00540, and by the Federal Education Agency of Russia under the grant 49123.en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherElsevier BVen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceDiscrete Appl Math2
dc.sourceDiscrete Applied Mathematicsen
dc.subjectCOMBINATORIAL COMPLEXITYen
dc.subjectFACTORIAL LANGUAGESen
dc.subjectINTERMEDIATE COMPLEXITYen
dc.subjectWEB-LIKE AUTOMATAen
dc.subjectQUERY LANGUAGESen
dc.subjectTRANSLATION (LANGUAGES)en
dc.subjectCOMBINATORIAL COMPLEXITYen
dc.subjectEXPONENTIAL FUNCTIONSen
dc.subjectFACTORIAL LANGUAGESen
dc.subjectFINITE ALPHABETSen
dc.subjectINTERMEDIATE COMPLEXITYen
dc.subjectNATURAL CONDITIONSen
dc.subjectNON-TRIVIALen
dc.subjectWEB-LIKE AUTOMATAen
dc.subjectLINGUISTICSen
dc.titleOn intermediate Factorial Languagesen
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/articleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.scopus61849155317-
local.contributor.employeeShur, A.M., Ural State University, Ekaterinburg, Russian Federationen
local.description.firstpage1669-
local.description.lastpage1675-
local.issue7-
local.volume157-
local.contributor.departmentUral State University, Ekaterinburg, Russian Federationen
local.identifier.eid2-s2.0-61849155317-
local.fund.rffi05-01-00540
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-61849155317.pdf545,54 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.