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

Acta Cybernetica最新文献

筛选
英文 中文
The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable 零和自由交换半环上可识别级数的支持是可识别的
IF 0.4
Acta Cybernetica Pub Date : 2009-07-01 DOI: 10.14232/actacyb.20.2.2011.1
D. Kirsten
{"title":"The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable","authors":"D. Kirsten","doi":"10.14232/actacyb.20.2.2011.1","DOIUrl":"https://doi.org/10.14232/actacyb.20.2.2011.1","url":null,"abstract":"We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative semiring into an automaton recognizing the support of S.","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78812818","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}
引用次数: 21
Conference of PhD Students in Computer Science - Preface 计算机科学博士研究生会议前言
IF 0.4
Acta Cybernetica Pub Date : 2009-01-01 DOI: 10.14232/actacyb.19.1.2009.1
K. Palágyi
{"title":"Conference of PhD Students in Computer Science - Preface","authors":"K. Palágyi","doi":"10.14232/actacyb.19.1.2009.1","DOIUrl":"https://doi.org/10.14232/actacyb.19.1.2009.1","url":null,"abstract":"","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66816377","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
An on-line speaker adaptation method for HMM-based speech recognizers 基于hmm的语音识别器的在线说话人自适应方法
IF 0.4
Acta Cybernetica Pub Date : 2008-01-01 DOI: 10.5555/1466514.1466517
BánhalmiAndrás, KocsorAndrás
{"title":"An on-line speaker adaptation method for HMM-based speech recognizers","authors":"BánhalmiAndrás, KocsorAndrás","doi":"10.5555/1466514.1466517","DOIUrl":"https://doi.org/10.5555/1466514.1466517","url":null,"abstract":"In the past few years numerous techniques have been proposed to improve the efficiency of basic adaptation methods like MLLR and MAP. These adaptation methods have a common aim, which is to increas...","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71117824","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
An approach based on genetic algorithms for clustering classes in components 基于遗传算法的组件类聚类方法
IF 0.4
Acta Cybernetica Pub Date : 2005-01-10 DOI: 10.5555/1133461.1133468
JisaDan Laurentiu
{"title":"An approach based on genetic algorithms for clustering classes in components","authors":"JisaDan Laurentiu","doi":"10.5555/1133461.1133468","DOIUrl":"https://doi.org/10.5555/1133461.1133468","url":null,"abstract":"The goal of this work is to create a model that allows identification of the software components (or subsystems according to the unified process terminology) based on the design models, or more exa...","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2005-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71108888","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
Extending the sparkle core language with object abstraction 用对象抽象扩展火花核心语言
IF 0.4
Acta Cybernetica Pub Date : 2005-01-10 DOI: 10.5555/1133461.1133476
TejfelMáté, HorváthZoltán, KozsikTamás
{"title":"Extending the sparkle core language with object abstraction","authors":"TejfelMáté, HorváthZoltán, KozsikTamás","doi":"10.5555/1133461.1133476","DOIUrl":"https://doi.org/10.5555/1133461.1133476","url":null,"abstract":"Sparkle is a theorem prover specially constructed for the functional programming language Clean. In a pure functional language like Clean the variables represent constant values; variables do not c...","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2005-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71109015","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
Topologies for the set of disjunctive ω-words 析取ω-词集合的拓扑结构
IF 0.4
Acta Cybernetica Pub Date : 2005-01-01 DOI: 10.1142/9789812810908_0032
L. Staiger
{"title":"Topologies for the set of disjunctive ω-words","authors":"L. Staiger","doi":"10.1142/9789812810908_0032","DOIUrl":"https://doi.org/10.1142/9789812810908_0032","url":null,"abstract":"An infinite sequence (ω-word) is referred to as disjunctive provided it contains every finite word as infix (factor). As Jurgensen and Thierrin [JT83] observed the set of disjunctive ω-words, D, has a trivial syntactic monoid but is not accepted by a finite automaton.In this paper we derive some topological properties of the set of disjunctive ω-words. We introduce two non-standard topologies on the set of all ω-words and show that D fulfills some special properties with respect to these topologies:In the first topology - the so-called topology of forbidden words - D is the smallest nonempty Gδ-set, and in the second one D is the set of accumulation points of the whole space as well as of itself.","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2005-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64043107","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
A pumping lemma and decidability problems for recognizable tree series 可识别树序列的抽运引理及可判定性问题
IF 0.4
Acta Cybernetica Pub Date : 2004-09-01 DOI: 10.5555/1052050.1052052
BorchardtBjörn
{"title":"A pumping lemma and decidability problems for recognizable tree series","authors":"BorchardtBjörn","doi":"10.5555/1052050.1052052","DOIUrl":"https://doi.org/10.5555/1052050.1052052","url":null,"abstract":"In the present paper we show that given a tree series S, which is accepted by (a) a deterministic bottom-up finite state weighted tree automaton (for short: bu-w-fta) or (b) a non-deterministic bu-...","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2004-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71107302","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
Phonetic level annotation and segmentation of Hungarian speech databases 匈牙利语语音数据库的语音层次标注与分词
IF 0.4
Acta Cybernetica Pub Date : 2004-09-01 DOI: 10.5555/1052050.1052061
ZsigriGyula, KocsorAndrás, TóthLászló, SejtesGyörgyi
{"title":"Phonetic level annotation and segmentation of Hungarian speech databases","authors":"ZsigriGyula, KocsorAndrás, TóthLászló, SejtesGyörgyi","doi":"10.5555/1052050.1052061","DOIUrl":"https://doi.org/10.5555/1052050.1052061","url":null,"abstract":"The purpose of this paper is to give an outline of phonetic level annotation and segmentation of Hungarian speech databases at the levels of definition and speech technology. In addition to giving ...","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2004-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71107528","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
Resource-conscious AI planning with conjunctions and disjunctions 具有资源意识的人工智能规划与连接和分离
IF 0.4
Acta Cybernetica Pub Date : 2002-12-01 DOI: 10.5555/763133.763149
KüngasPeep
{"title":"Resource-conscious AI planning with conjunctions and disjunctions","authors":"KüngasPeep","doi":"10.5555/763133.763149","DOIUrl":"https://doi.org/10.5555/763133.763149","url":null,"abstract":"The aim of this work is to develop a resource-conscious Artificial Intelligence (AI) planning system, which allows for nondeterminism in the environment. Such planner has a potential in application...","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2002-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71142554","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
Definition of a parallel execution model with abstract state machines 用抽象状态机定义并行执行模型
IF 0.4
Acta Cybernetica Pub Date : 2002-09-01 DOI: 10.5555/603051.603059
NémethZsolt
{"title":"Definition of a parallel execution model with abstract state machines","authors":"NémethZsolt","doi":"10.5555/603051.603059","DOIUrl":"https://doi.org/10.5555/603051.603059","url":null,"abstract":"Languages, architectures and execution models are strongly related. A new architectural platform makes necessary to modify the execution model in order to exploit all the advantages of the underlyi...","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2002-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71141890","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
首页 上一页 下一页 尾页
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学术官方微信