Pub Date : 2003-07-01DOI: 10.1142/9789812704979_0026
Ryuki Matsuda
{"title":"Characterization of Valuation Rings and Valuation Semigroups by Semistar-Operations","authors":"Ryuki Matsuda","doi":"10.1142/9789812704979_0026","DOIUrl":"https://doi.org/10.1142/9789812704979_0026","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"1 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":"130089778","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 : 2003-07-01DOI: 10.1142/9789812704979_0018
A. Kelarev, P. G. Trotter
{"title":"A Combinatorial Property of Languages and Monoids","authors":"A. Kelarev, P. G. Trotter","doi":"10.1142/9789812704979_0018","DOIUrl":"https://doi.org/10.1142/9789812704979_0018","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"138 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":"116389819","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 : 2003-07-01DOI: 10.1142/9789812704979_0014
P. Dömösi, M. Kudlek
{"title":"An Improvement of Iteration Lemmata for Context-free Languages","authors":"P. Dömösi, M. Kudlek","doi":"10.1142/9789812704979_0014","DOIUrl":"https://doi.org/10.1142/9789812704979_0014","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"88 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":"131000502","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 : 2003-07-01DOI: 10.1142/9789812704979_0027
Gundula Niemann, F. Otto
{"title":"Further Results on Restarting Automata","authors":"Gundula Niemann, F. Otto","doi":"10.1142/9789812704979_0027","DOIUrl":"https://doi.org/10.1142/9789812704979_0027","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"26 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":"123213272","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 : 2003-07-01DOI: 10.1142/9789812704979_0004
S. Avgustinovich, D. Fon-Der-Flaass, A. Frid
{"title":"Arithmetical Complexity of Infinite Words","authors":"S. Avgustinovich, D. Fon-Der-Flaass, A. Frid","doi":"10.1142/9789812704979_0004","DOIUrl":"https://doi.org/10.1142/9789812704979_0004","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"86 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":"127284425","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 : 2003-07-01DOI: 10.1142/9789812704979_0010
J. Dassow
{"title":"On the Differentiation Function of some Language Generating Devices","authors":"J. Dassow","doi":"10.1142/9789812704979_0010","DOIUrl":"https://doi.org/10.1142/9789812704979_0010","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":"131028471","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 : 2003-07-01DOI: 10.1142/9789812704979_0008
C. Choffrut, S. Grigorieff
In order to explain the purpose of this paper, we recall briefly how the theory of “rationality” developed in the last fourty years. The theory of sets of finite strings recognized by finite automata, also known as regular or rational sets was developed in the fifties. It rapidly extended in two directions. Indeed, by solving the decidability problem of the second order monadic theory of one successor, Buchi was led naturally to introduce the notion of finite automata working on infinite strings. He further extended this result to the monadic theory of all denumerable ordinals, and by doing so he again modified the original notion of finite automata to suit his new purpose, [9]. At this point, the equivalence between the notions of recognizability (by “finite automata”), rationality (by “rational expressions”) and definability (by “monadic second order logics”) was achieved as far as strings of denumerable lengths were concerned. In the late sixties, Elgot and Mezei wrote an historical paper on rational relations [15] which was a successful attempt to construct the theory of relations between free monoids that could be recognized by so-called n-tape automata. Though hard to read, it contained the basic results of the theory. In the mid eighties Gire and Nivat showed that the theory of rational relations on finite strings carries over to
{"title":"The Theory of Rational Relations on Transfinite Strings","authors":"C. Choffrut, S. Grigorieff","doi":"10.1142/9789812704979_0008","DOIUrl":"https://doi.org/10.1142/9789812704979_0008","url":null,"abstract":"In order to explain the purpose of this paper, we recall briefly how the theory of “rationality” developed in the last fourty years. The theory of sets of finite strings recognized by finite automata, also known as regular or rational sets was developed in the fifties. It rapidly extended in two directions. Indeed, by solving the decidability problem of the second order monadic theory of one successor, Buchi was led naturally to introduce the notion of finite automata working on infinite strings. He further extended this result to the monadic theory of all denumerable ordinals, and by doing so he again modified the original notion of finite automata to suit his new purpose, [9]. At this point, the equivalence between the notions of recognizability (by “finite automata”), rationality (by “rational expressions”) and definability (by “monadic second order logics”) was achieved as far as strings of denumerable lengths were concerned. In the late sixties, Elgot and Mezei wrote an historical paper on rational relations [15] which was a successful attempt to construct the theory of relations between free monoids that could be recognized by so-called n-tape automata. Though hard to read, it contained the basic results of the theory. In the mid eighties Gire and Nivat showed that the theory of rational relations on finite strings carries over to","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"4 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":"122352247","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 : 2003-07-01DOI: 10.1142/9789812704979_0006
T. Buchholz, A. Klein, Martin Kutrib
An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fetches the input serially symbol by symbol. Sometimes in the literature this model is referred to as cellular automaton with sequential input mode. We are investigating iterative arrays with a nondeterministic communication cell. All the other cells are deterministic ones. The number of nondeterministic state transitions is regarded as a limited resource which depends on the length of the input. It is shown that the limit can be reduced by a constant factor without affecting the language accepting capabilities, but for sublogarithmic limits there exists an infinite hierarchy of properly included real-time language families. Finally we prove several closure properties of these families.
{"title":"Iterative Arrays With Limited Nondeterministic Communication Cell","authors":"T. Buchholz, A. Klein, Martin Kutrib","doi":"10.1142/9789812704979_0006","DOIUrl":"https://doi.org/10.1142/9789812704979_0006","url":null,"abstract":"An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fetches the input serially symbol by symbol. Sometimes in the literature this model is referred to as cellular automaton with sequential input mode. We are investigating iterative arrays with a nondeterministic communication cell. All the other cells are deterministic ones. The number of nondeterministic state transitions is regarded as a limited resource which depends on the length of the input. It is shown that the limit can be reduced by a constant factor without affecting the language accepting capabilities, but for sublogarithmic limits there exists an infinite hierarchy of properly included real-time language families. Finally we prove several closure properties of these families.","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"61 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":"127550325","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 : 2003-07-01DOI: 10.1142/9789812704979_0007
Olivier Carton
{"title":"R-Trivial Languages of Words on Countable Ordinals","authors":"Olivier Carton","doi":"10.1142/9789812704979_0007","DOIUrl":"https://doi.org/10.1142/9789812704979_0007","url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"30 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":"127827449","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
扫码关注我们
求助内容：
应助结果提醒方式：