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

Words, Languages & Combinatorics最新文献

筛选
英文 中文
Key Agreement Protocol Securer than DLOG 密钥协议比DLOG更安全
Words, Languages & Combinatorics Pub Date : 2003-07-01 DOI: 10.1142/9789812704979_0035
A. Yamamura, K. Kurosawa
{"title":"Key Agreement Protocol Securer than DLOG","authors":"A. Yamamura, K. Kurosawa","doi":"10.1142/9789812704979_0035","DOIUrl":"https://doi.org/10.1142/9789812704979_0035","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131529117","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
Networks of Watson-Crick D0L Systems 沃森-克里克D0L系统网络
Words, Languages & Combinatorics Pub Date : 2003-07-01 DOI: 10.1142/9789812704979_0009
E. Csuhaj-Varjú, A. Salomaa
{"title":"Networks of Watson-Crick D0L Systems","authors":"E. Csuhaj-Varjú, A. Salomaa","doi":"10.1142/9789812704979_0009","DOIUrl":"https://doi.org/10.1142/9789812704979_0009","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129409202","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}
引用次数: 17
A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples 关于寻找与例子和反例子一致的单变量模式的注释
Words, Languages & Combinatorics Pub Date : 2003-07-01 DOI: 10.1142/9789812704979_0020
Takeshi Koshiba, K. Hiraishi
{"title":"A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples","authors":"Takeshi Koshiba, K. Hiraishi","doi":"10.1142/9789812704979_0020","DOIUrl":"https://doi.org/10.1142/9789812704979_0020","url":null,"abstract":"We consider the problem of finding one-variable patterns consistent with given positive examples and negative examples. We try to give some evidence that the pattern finding problem is computationally difficult by finding an NP-complete graph problem (called MCP) such that the pattern finding problem is a subproblem of MCP. We also give sufficient conditions such that the pattern finding problem is polynomial-time computable and show that some of the conditions are related with solving word-equations in one variable.","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130238613","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
Generalized Directable Automata 广义可定向自动机
Words, Languages & Combinatorics Pub Date : 2003-07-01 DOI: 10.1142/9789812704979_0029
Žarko Popović, S. Bogdanovic, T. Petkovic, M. Ciric
{"title":"Generalized Directable Automata","authors":"Žarko Popović, S. Bogdanovic, T. Petkovic, M. Ciric","doi":"10.1142/9789812704979_0029","DOIUrl":"https://doi.org/10.1142/9789812704979_0029","url":null,"abstract":"In [18] the last three authors introduced the notion of a generalized directable automaton as a generalization of many already known types of automata. The algorithms for testing whether a finite automaton belongs to some of important subclasses of the class of generalized directable automata are studied by the authors in [20]. In this paper structural properties of finite and infinite generalized directable automata are considered, tests for membership of a finite automaton in the pseudovarieties of generalized directable and locally directable automata are given, and the least generalized directing and locally directing congruences on a finite automaton are described.","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121971809","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}
引用次数: 7
On the Star Height of Rational Languages: A New Presentation for Two Old Results 论理性语言的明星高度:两个旧成果的新呈现
Words, Languages & Combinatorics Pub Date : 2003-07-01 DOI: 10.1142/9789812704979_0021
S. Lombardy, J. Sakarovitch
{"title":"On the Star Height of Rational Languages: A New Presentation for Two Old Results","authors":"S. Lombardy, J. Sakarovitch","doi":"10.1142/9789812704979_0021","DOIUrl":"https://doi.org/10.1142/9789812704979_0021","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114960995","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}
引用次数: 11
A Parsing Problem for Context-Sensitive Languages 上下文敏感语言的解析问题
Words, Languages & Combinatorics Pub Date : 2003-07-01 DOI: 10.1142/9789812704979_0013
P. Dömösi, Masami Ito
{"title":"A Parsing Problem for Context-Sensitive Languages","authors":"P. Dömösi, Masami Ito","doi":"10.1142/9789812704979_0013","DOIUrl":"https://doi.org/10.1142/9789812704979_0013","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"42 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130660714","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
Quantum Finite Automata 量子有限自动机
Words, Languages & Combinatorics Pub Date : 2003-07-01 DOI: 10.1142/9789812704979_0015
J. Gruska, R. Vollmar
{"title":"Quantum Finite Automata","authors":"J. Gruska, R. Vollmar","doi":"10.1142/9789812704979_0015","DOIUrl":"https://doi.org/10.1142/9789812704979_0015","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133993826","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
A Note on Rademacher Functions and Computability 关于Rademacher函数和可计算性的注解
Words, Languages & Combinatorics Pub Date : 2003-07-01 DOI: 10.1142/9789812704979_0036
M. Yasugi, Masako Washihara
{"title":"A Note on Rademacher Functions and Computability","authors":"M. Yasugi, Masako Washihara","doi":"10.1142/9789812704979_0036","DOIUrl":"https://doi.org/10.1142/9789812704979_0036","url":null,"abstract":"We will speculate on some computational properties of the system of Rademacher functions f n g. The n-th Rademacher function n is a step function on the interval [0; 1), jumping at nitely many dyadic rationals of size 1 2 n and assuming values f1; 1g alternatingly.","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126853907","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}
引用次数: 12
Power Semigroups and Polynomial Closure 幂半群与多项式闭包
Words, Languages & Combinatorics Pub Date : 2003-07-01 DOI: 10.1142/9789812704979_0024
S. Margolis, B. Steinberg
{"title":"Power Semigroups and Polynomial Closure","authors":"S. Margolis, B. Steinberg","doi":"10.1142/9789812704979_0024","DOIUrl":"https://doi.org/10.1142/9789812704979_0024","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125877695","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}
引用次数: 4
Routes and Trajectories 路线和轨迹
Words, Languages & Combinatorics Pub Date : 1900-01-01 DOI: 10.1142/9789812704979_0025
A. Mateescu
{"title":"Routes and Trajectories","authors":"A. Mateescu","doi":"10.1142/9789812704979_0025","DOIUrl":"https://doi.org/10.1142/9789812704979_0025","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128469473","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学术文献互助群
群 号：481959085
Book学术官方微信