Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/37967
DC FieldValueLanguage
dc.contributor.authorYu, S.S.en_US
dc.contributor.author喻石生zh_TW
dc.date1998zh_TW
dc.date.accessioned2014-06-06T08:00:20Z-
dc.date.available2014-06-06T08:00:20Z-
dc.identifier.issn0012-365Xzh_TW
dc.identifier.urihttp://hdl.handle.net/11455/37967-
dc.description.abstractAs every non-empty word is a power of a unique primitive word, a set of primitive roots of a language is like an independent subset of a vector space. A language having finitely many primitive roots is called a local language. The purpose of this paper is to characterize local regular languages. We show that whether a regular language is local or not is decidable. In the meanwhile, two characterizations of local regular languages are derived. (C) 1998 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USzh_TW
dc.relationDiscrete Mathematicsen_US
dc.relation.ispartofseriesDiscrete Mathematics, Volume 184, Issue 1-3, Page(s) 195-203.en_US
dc.relation.urihttp://dx.doi.org/10.1016/s0012-365x(97)00258-6en_US
dc.subjectformal languageen_US
dc.subjectfinite automatonen_US
dc.subjectregular languageen_US
dc.subjectcombinatorics ofen_US
dc.subjectwordsen_US
dc.titleA characterization of local regular languagesen_US
dc.typeJournal Articlezh_TW
dc.identifier.doi10.1016/s0012-365x(97)00258-6zh_TW
item.openairetypeJournal Article-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en_US-
item.grantfulltextnone-
item.fulltextno fulltext-
item.cerifentitytypePublications-
crisitem.author.dept資訊科學與工程學系所-
crisitem.author.parentorg理學院-
Appears in Collections:資訊科學與工程學系所
Show simple item record
 

Google ScholarTM

Check

Altmetric

Altmetric


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