发布求助
文献互助 智能选刊 最新文献

Int. J. Found. Comput. Sci.最新文献

筛选
英文 中文
Symbol Separation in Double Occurrence Words 双出现词中的符号分离
Int. J. Found. Comput. Sci. Pub Date : 2020-11-01 DOI: 10.1142/s0129054120500343
N. Jonoska, M. Saito, Hwee Kim, Brad Mostowski
{"title":"Symbol Separation in Double Occurrence Words","authors":"N. Jonoska, M. Saito, Hwee Kim, Brad Mostowski","doi":"10.1142/s0129054120500343","DOIUrl":"https://doi.org/10.1142/s0129054120500343","url":null,"abstract":"A double occurrence word (DOW) is a word in which every symbol appears exactly twice. We define the symbol separation of a DOW [Formula: see text] to be the number of letters between the two copies of a symbol, and the separation of [Formula: see text] to be the sum of separations over all symbols in [Formula: see text]. We then analyze relationship among size, reducibility and separation of DOWs. Specifically, we provide tight bounds of separations of DOWs with a given size and characterize the words that attain those bounds. We show that all separation numbers within the bounds can be realized. We present recursive formulas for counting the numbers of DOWs with a given separation under various restrictions, such as the number of irreducible factors. These formulas can be obtained by inductive construction of all DOWs with the given separation.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127751977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks 基于环相关网络聚集的节点重要性高效识别
Int. J. Found. Comput. Sci. Pub Date : 2020-11-01 DOI: 10.1142/s0129054120500379
Aysun Asena Kunt, Zeynep Nihan Berberler
{"title":"Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks","authors":"Aysun Asena Kunt, Zeynep Nihan Berberler","doi":"10.1142/s0129054120500379","DOIUrl":"https://doi.org/10.1142/s0129054120500379","url":null,"abstract":"The identification of node importance in complex networks is of theoretical and practical significance for improving network robustness and invulnerability. In this paper, the importance of each node is evaluated and important nodes are identified in cycles and related networks by node contraction method based on network agglomeration. This novel method considers both the degree and the position of the node for the identifying the importance of the node. The effectiveness and the feasibility of this method was also validated through experiments on different types of complex networks.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126266771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Special Issue Developments in Language Theory 2018 - Preface 2018年语言理论发展特刊前言
Int. J. Found. Comput. Sci. Pub Date : 2020-09-01 DOI: 10.1142/s0129054120020025
S. Seki
{"title":"Special Issue Developments in Language Theory 2018 - Preface","authors":"S. Seki","doi":"10.1142/s0129054120020025","DOIUrl":"https://doi.org/10.1142/s0129054120020025","url":null,"abstract":"","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114420666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus 素幂模广义多项式商二元阈值序列的线性复杂度
Int. J. Found. Comput. Sci. Pub Date : 2020-08-31 DOI: 10.1142/s0129054120500264
Lianhua Wang, Xiaoni Du
{"title":"Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus","authors":"Lianhua Wang, Xiaoni Du","doi":"10.1142/s0129054120500264","DOIUrl":"https://doi.org/10.1142/s0129054120500264","url":null,"abstract":"In this paper, firstly we extend the polynomial quotient modulo an odd prime p to its general case with modulo pr and r ≥ 1. From the new quotient proposed, we define a class of pr+1-periodic binar...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"11 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120909816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes k-斐波那契立方体:斐波那契立方体的一组子图
Int. J. Found. Comput. Sci. Pub Date : 2020-08-26 DOI: 10.1142/s0129054120500318
Ö. Eğecioğlu, Elif Saygı, Zülfükar Saygı
{"title":"k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes","authors":"Ö. Eğecioğlu, Elif Saygı, Zülfükar Saygı","doi":"10.1142/s0129054120500318","DOIUrl":"https://doi.org/10.1142/s0129054120500318","url":null,"abstract":"Hypercubes and Fibonacci cubes are classical models for interconnection networks with interesting graph theoretic properties. We consider k-Fibonacci cubes, which we obtain as subgraphs of Fibonacc...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130432084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Weak Separation Problem for Tree Languages 树状语言的弱分离问题
Int. J. Found. Comput. Sci. Pub Date : 2020-08-26 DOI: 10.1142/s0129054120500276
S. Alirezazadeh, Khadijeh Alibabaei
{"title":"Weak Separation Problem for Tree Languages","authors":"S. Alirezazadeh, Khadijeh Alibabaei","doi":"10.1142/s0129054120500276","DOIUrl":"https://doi.org/10.1142/s0129054120500276","url":null,"abstract":"Forest algebras are defined for investigating languages of forests [ordered sequences] of unranked trees, where a node may have more than two [ordered] successors. They consist of two monoids, the ...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"33 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114132686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting 辅助输入设置下格的多用途确定性公钥代理重加密
Int. J. Found. Comput. Sci. Pub Date : 2020-08-12 DOI: 10.1142/s0129054120500252
Juyan Li, Chunguang Ma, Zhen Gu
{"title":"Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting","authors":"Juyan Li, Chunguang Ma, Zhen Gu","doi":"10.1142/s0129054120500252","DOIUrl":"https://doi.org/10.1142/s0129054120500252","url":null,"abstract":"Proxy Re-Encryption (PRE) is a cryptographic primitive that allows a proxy to turn an Alice’s ciphertext into a Bob’s ciphertext on the same plaintext. All of the PRE schemes are public key encrypt...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130522477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A New Study of Parikh Matrices Restricted to Terms 限制项的Parikh矩阵的新研究
Int. J. Found. Comput. Sci. Pub Date : 2020-08-12 DOI: 10.1142/s0129054120500306
Zi Jing Chern, K. Subramanian, Azhana Ahmad, W. C. Teh
{"title":"A New Study of Parikh Matrices Restricted to Terms","authors":"Zi Jing Chern, K. Subramanian, Azhana Ahmad, W. C. Teh","doi":"10.1142/s0129054120500306","DOIUrl":"https://doi.org/10.1142/s0129054120500306","url":null,"abstract":"Parikh matrices as an extension of Parikh vectors are useful tools in arithmetizing words by numbers. This paper presents a further study of Parikh matrices by restricting the corresponding words t...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128683122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Identification of k-Closed Strings k闭串的高效识别
Int. J. Found. Comput. Sci. Pub Date : 2020-08-01 DOI: 10.1007/978-3-319-65172-9_49
H. Alamro, Mai Alzamel, C. Iliopoulos, S. Pissis, Steven Watts, W. Sung
{"title":"Efficient Identification of k-Closed Strings","authors":"H. Alamro, Mai Alzamel, C. Iliopoulos, S. Pissis, Steven Watts, W. Sung","doi":"10.1007/978-3-319-65172-9_49","DOIUrl":"https://doi.org/10.1007/978-3-319-65172-9_49","url":null,"abstract":"","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125168269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties 提交图的回文特征及一些模型论性质
Int. J. Found. Comput. Sci. Pub Date : 2020-07-06 DOI: 10.1142/s0129054120500203
A. Cevik
{"title":"Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties","authors":"A. Cevik","doi":"10.1142/s0129054120500203","DOIUrl":"https://doi.org/10.1142/s0129054120500203","url":null,"abstract":"We bring into attention the interplay between model theory of committed graphs (1-regular graphs) and their palindromic characteristic in the domain of formal languages. We prove some model theoret...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114426457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信