{"title":"ω-有理函数的两个有效性质","authors":"O. Finkel","doi":"10.1142/s0129054121500283","DOIUrl":null,"url":null,"abstract":"We prove two new effective properties of rational functions over infinite words which are realized by finite state Büchi transducers. Firstly, for each such function [Formula: see text], one can construct a deterministic Büchi automaton [Formula: see text] accepting a dense [Formula: see text]-subset of [Formula: see text] such that the restriction of [Formula: see text] to [Formula: see text] is continuous. Secondly, we give a new proof of the decidability of the first Baire class for synchronous [Formula: see text]-rational functions from which we get an extension of this result involving the notion of Wadge classes of regular [Formula: see text]-languages.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"15 12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Two Effective Properties of ω-Rational Functions\",\"authors\":\"O. Finkel\",\"doi\":\"10.1142/s0129054121500283\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove two new effective properties of rational functions over infinite words which are realized by finite state Büchi transducers. Firstly, for each such function [Formula: see text], one can construct a deterministic Büchi automaton [Formula: see text] accepting a dense [Formula: see text]-subset of [Formula: see text] such that the restriction of [Formula: see text] to [Formula: see text] is continuous. Secondly, we give a new proof of the decidability of the first Baire class for synchronous [Formula: see text]-rational functions from which we get an extension of this result involving the notion of Wadge classes of regular [Formula: see text]-languages.\",\"PeriodicalId\":192109,\"journal\":{\"name\":\"Int. J. Found. Comput. Sci.\",\"volume\":\"15 12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Found. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0129054121500283\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Found. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054121500283","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We prove two new effective properties of rational functions over infinite words which are realized by finite state Büchi transducers. Firstly, for each such function [Formula: see text], one can construct a deterministic Büchi automaton [Formula: see text] accepting a dense [Formula: see text]-subset of [Formula: see text] such that the restriction of [Formula: see text] to [Formula: see text] is continuous. Secondly, we give a new proof of the decidability of the first Baire class for synchronous [Formula: see text]-rational functions from which we get an extension of this result involving the notion of Wadge classes of regular [Formula: see text]-languages.