析取ω-词集合的拓扑结构

IF 0.3 Q4 COMPUTER SCIENCE, CYBERNETICS Acta Cybernetica Pub Date : 2005-01-01 DOI:10.1142/9789812810908_0032
L. Staiger
{"title":"析取ω-词集合的拓扑结构","authors":"L. Staiger","doi":"10.1142/9789812810908_0032","DOIUrl":null,"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.3000,"publicationDate":"2005-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Topologies for the set of disjunctive ω-words\",\"authors\":\"L. Staiger\",\"doi\":\"10.1142/9789812810908_0032\",\"DOIUrl\":null,\"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.3000,\"publicationDate\":\"2005-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Cybernetica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/9789812810908_0032\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybernetica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789812810908_0032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 7

摘要

一个无限序列(ω-word)被称为析取序列,只要它包含了每个有限的单词作为中缀(因子)。正如Jurgensen和Thierrin [JT83]所观察到的那样,析取ω-words的集合D具有平凡的句法一元,但不被有限自动机所接受。本文导出了析取ω-词集的一些拓扑性质。我们在所有ω-词的集合上引入了两个非标准拓扑,并证明了D满足关于这些拓扑的一些特殊性质:在第一个拓扑中,即所谓的禁止词的拓扑中,D是最小的非空g -集,在第二个拓扑中,D是整个空间和自身的累加点的集合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Topologies for the set of disjunctive ω-words
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Acta Cybernetica
Acta Cybernetica COMPUTER SCIENCE, CYBERNETICS-
CiteScore
1.10
自引率
0.00%
发文量
17
期刊介绍: Acta Cybernetica publishes only original papers in the field of Computer Science. Manuscripts must be written in good English.
期刊最新文献
Integer Programming Based Optimization of Power Consumption for Data Center Networks Refined Fuzzy Profile Matching Corner-Based Implicit Patches Towards Abstraction-based Probabilistic Program Analysis Dual Convolutional Neural Network Classifier with Pyramid Attention Network for Image-Based Kinship Verification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1