Pub Date : 2009-07-01DOI: 10.14232/actacyb.20.2.2011.1
D. Kirsten
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.
{"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}
Pub Date : 2009-01-01DOI: 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}
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...
{"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}
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...
{"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}
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...
{"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}
Pub Date : 2005-01-01DOI: 10.1142/9789812810908_0032
L. Staiger
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.
{"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}
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-...
{"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}
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 ...
本文从定义和语音技术两个层面对匈牙利语语音数据库的语音层次标注和分词进行了概述。除了给予…
{"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}
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...
{"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}
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...
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：