標(biāo)題: Titlebook: Developments in Language Theory; 9th International Co Clelia Felice,Antonio Restivo Conference proceedings 2005 Springer-Verlag Berlin Heid [打印本頁] 作者: Body-Mass-Index 時(shí)間: 2025-3-21 16:55
書目名稱Developments in Language Theory影響因子(影響力)
書目名稱Developments in Language Theory影響因子(影響力)學(xué)科排名
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Developments in Language Theory被引頻次
書目名稱Developments in Language Theory被引頻次學(xué)科排名
書目名稱Developments in Language Theory年度引用
書目名稱Developments in Language Theory年度引用學(xué)科排名
書目名稱Developments in Language Theory讀者反饋
書目名稱Developments in Language Theory讀者反饋學(xué)科排名
作者: 小口啜飲 時(shí)間: 2025-3-21 23:58 作者: 規(guī)范要多 時(shí)間: 2025-3-22 03:51 作者: Influx 時(shí)間: 2025-3-22 06:34
Boxiang Lin,Pingping Fu,Bo Yangs of Sturmian words. The aim of this paper is to give an overview on central words focusing some recent developments in the study of their structure, combinatorics, and arithmetics. Moreover, some results are concerned with remarkable languages of central words such as central codes and Farey’s code作者: Palter 時(shí)間: 2025-3-22 10:17 作者: MAUVE 時(shí)間: 2025-3-22 14:38
Humanistic Leadership: A UAE Perspectiven certain generalizations of first-order logic.?[10]. This provides me with a good excuse for describing some the work on the algebraic theory of regular languages in what one might call “nonregular settings”..The syntactic monoid and syntactic morphism of a regular language provide a highly effecti作者: MAUVE 時(shí)間: 2025-3-22 19:36 作者: FANG 時(shí)間: 2025-3-22 21:55 作者: 客觀 時(shí)間: 2025-3-23 03:40
Humanistic Pedagogy Across the Disciplines Even when using only one symbol, any recursively enumerable set of natural numbers can be generated with at most seven cells. On the other hand, with only one cell we can only generate regular sets when using one channel with the environment, whereas one cell with two channels between the cell and 作者: Wordlist 時(shí)間: 2025-3-23 05:42
Humanistic Pedagogy Across the DisciplinesΣ preserves the restriction of the order to the domain of the transformation. We show that if . possesses a ‘killer’ word .∈Σ. whose action is nowhere defined, then . is ‘killed’ by a word of length ..作者: NEEDY 時(shí)間: 2025-3-23 13:47 作者: FRET 時(shí)間: 2025-3-23 15:19
Harnessing Hospitality for Human Flourishingps. This gives an algebraic characterization of star-free sets. The variety theorem of Eilenberg offers a general framework for the algebraic characterization of recognizable sets: it establishes a one-to-one correspondence between varieties of languages of finite words and pseudo-varieties of algeb作者: Perigee 時(shí)間: 2025-3-23 19:19 作者: deciduous 時(shí)間: 2025-3-24 02:01
Kemi Ogunyemi,Ebele Okoye,Omowumi Ogunyemiining part of the input. We consider three different modes of shifting, namely revolving to the left, revolving to the right, and circular interchanging. We show that the latter operation does not increase the computational power of finite automata, even if the number of revolving operations is unbo作者: AVERT 時(shí)間: 2025-3-24 05:47
Dijin Wang,Asad Mohsin,Jorge Lenglerc factors and the palindromic prefixes of Sturmian words and billiard words on two letters. We give general results concerning multidimensional billiard words, which describe very different situations. In some cases, these words have arbitrary long palindromic prefix factors. In other cases, at the 作者: Jejune 時(shí)間: 2025-3-24 09:09
Andrew Creed,Jane Ross,Jack Rossary, we obtain a characteristic property of self-avoiding closed paths, generalizing in this way a recent result of Daurat and Nivat (2003) on the boundary properties of polyominoes concerning salient and reentrant points.作者: Indolent 時(shí)間: 2025-3-24 12:30 作者: 花爭(zhēng)吵 時(shí)間: 2025-3-24 16:55
Marianela Rivera,Ousama Nuhad SalhaWe study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.作者: 瘋狂 時(shí)間: 2025-3-24 19:03 作者: addict 時(shí)間: 2025-3-25 02:05 作者: CESS 時(shí)間: 2025-3-25 05:54
Palindromes in Sturmian Words,We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.作者: 恭維 時(shí)間: 2025-3-25 07:31 作者: 為現(xiàn)場(chǎng) 時(shí)間: 2025-3-25 14:32 作者: 農(nóng)學(xué) 時(shí)間: 2025-3-25 16:12 作者: 全神貫注于 時(shí)間: 2025-3-25 23:44
Sonja Novkovi?,Cian McMahon,Karen Miner possible restrictions on the permitted moves between pegs. We prove that all these Hanoi puzzles give rise to infinite morphic sequences of moves, whose appropriate truncations describe the transfer of any given number of disks. Furthermore two of these infinite sequences are actually automatic sequences.作者: Canvas 時(shí)間: 2025-3-26 02:02
Jeffrey Bardzell,Shaowen Bardzellword .∈Σ. (depending on .). We overview some recent results related to this notion. One of these results implies that the property of being .-collapsing is algorithmically recognizable for any given positive integer ..作者: Range-Of-Motion 時(shí)間: 2025-3-26 05:29 作者: extrovert 時(shí)間: 2025-3-26 11:51 作者: Bridle 時(shí)間: 2025-3-26 13:01
Well-being Marketing as Humanistic Marketing a rational subset of the finitely generated semigroup . with . as the set of generators and language concatenation as a product. We prove that for any rational set . and any regular language .???Σ. it is decidable (1) whether . or not, and (2) whether . is finite or not.作者: 樹膠 時(shí)間: 2025-3-26 18:08 作者: 發(fā)電機(jī) 時(shí)間: 2025-3-26 22:22
Kemi Ogunyemi,Omowumi Ogunyemi,Ebele Okoyearacterization of characteristic Sturmian words which are fixed points of morphisms. In this article, we extend this approach to all Sturmian words. The Sturmian words viewed as dynamical systems play an important role in obtaining this generalization.作者: 散開 時(shí)間: 2025-3-27 01:57 作者: Goblet-Cells 時(shí)間: 2025-3-27 07:02 作者: cleaver 時(shí)間: 2025-3-27 12:57
978-3-540-26546-7Springer-Verlag Berlin Heidelberg 2005作者: 引起痛苦 時(shí)間: 2025-3-27 14:24 作者: Paradox 時(shí)間: 2025-3-27 20:48 作者: 全神貫注于 時(shí)間: 2025-3-28 01:48
Locally Consistent Parsing and Applications to Approximate String Comparisons,vely applied, LCP followed by consistent block labeling provides a powerful tool for processing strings for a multitude of problems. In this paper we summarize applications of LCP in approximating well known distance measures between pairs of strings in (almost) linear time.作者: Eclampsia 時(shí)間: 2025-3-28 03:46 作者: 小平面 時(shí)間: 2025-3-28 09:23
Membership and Finiteness Problems for Rational Sets of Regular Languages, a rational subset of the finitely generated semigroup . with . as the set of generators and language concatenation as a product. We prove that for any rational set . and any regular language .???Σ. it is decidable (1) whether . or not, and (2) whether . is finite or not.作者: Gene408 時(shí)間: 2025-3-28 14:01 作者: 真實(shí)的你 時(shí)間: 2025-3-28 17:57
Sturmian Words: Dynamical Systems and Derivated Words,aracterization of characteristic Sturmian words which are fixed points of morphisms. In this article, we extend this approach to all Sturmian words. The Sturmian words viewed as dynamical systems play an important role in obtaining this generalization.作者: seroma 時(shí)間: 2025-3-28 19:37 作者: CODA 時(shí)間: 2025-3-29 02:49
Clelia Felice,Antonio RestivoIncludes supplementary material: 作者: Brochure 時(shí)間: 2025-3-29 06:49
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/270230.jpg作者: 藕床生厭倦 時(shí)間: 2025-3-29 07:48
Complexity of Quantum Uniform and Nonuniform Automata,nd for the width of quantum OBDDs depending on the error . allowed..Next we consider “generalized measure-many” quantum automata. It is appeared that for uniform and nonuniform automata (for space restricted models) their measure-once and measure-many models have different computational power.作者: 現(xiàn)存 時(shí)間: 2025-3-29 14:59
On the Membership of Invertible Diagonal Matrices,ces by a reduction of the Post Correspondence Problem (PCP). Although the idea of PCP reduction is standard for such problems, we suggest a new coding technique to cover the case of diagonal matrices.作者: 持久 時(shí)間: 2025-3-29 18:49 作者: VEN 時(shí)間: 2025-3-29 21:14
Harnessing Hospitality for Human Flourishingrization of recognizable sets: it establishes a one-to-one correspondence between varieties of languages of finite words and pseudo-varieties of algebras. This paper contains extensions of those two well-known results to words on countable scattered linear orderings.作者: 不舒服 時(shí)間: 2025-3-30 00:33 作者: 藥物 時(shí)間: 2025-3-30 04:26 作者: 轉(zhuǎn)換 時(shí)間: 2025-3-30 09:55
Revolving-Input Finite Automata, family of context-free languages, and are strictly more powerful than regular languages. Moreover, we show that right revolving can be simulated by left revolving, when considering the mirror image of the input.作者: entail 時(shí)間: 2025-3-30 12:54
Humanistic Pedagogy Across the Disciplinesere seems to be a trade-off between the number of cells and the number of symbols, e.g., for the case of tissue P systems with two channels between a cell and the environment we show that computational completeness can be obtained with two cells and three symbols as well as with three cells and two symbols, respectively.作者: Spina-Bifida 時(shí)間: 2025-3-30 19:35
Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells,ere seems to be a trade-off between the number of cells and the number of symbols, e.g., for the case of tissue P systems with two channels between a cell and the environment we show that computational completeness can be obtained with two cells and three symbols as well as with three cells and two symbols, respectively.作者: Melatonin 時(shí)間: 2025-3-31 00:38 作者: 撕裂皮肉 時(shí)間: 2025-3-31 03:20 作者: Minikin 時(shí)間: 2025-3-31 09:01
Some New Results on Palindromic Factors of Billiard Words,rd words, which describe very different situations. In some cases, these words have arbitrary long palindromic prefix factors. In other cases, at the opposite, they have finitely many distinct palindromic factors.. . 68R15.作者: demote 時(shí)間: 2025-3-31 12:22
Grace B. Yu,Dong-Jin Lee,M. Joseph Sirgynd for the width of quantum OBDDs depending on the error . allowed..Next we consider “generalized measure-many” quantum automata. It is appeared that for uniform and nonuniform automata (for space restricted models) their measure-once and measure-many models have different computational power.作者: brother 時(shí)間: 2025-3-31 14:31 作者: 乞丐 時(shí)間: 2025-3-31 20:28 作者: 我們的面粉 時(shí)間: 2025-3-31 23:27
Collapsing Words: A Progress Report,word .∈Σ. (depending on .). We overview some recent results related to this notion. One of these results implies that the property of being .-collapsing is algorithmically recognizable for any given positive integer ..作者: 克制 時(shí)間: 2025-4-1 02:39
Locally Consistent Parsing and Applications to Approximate String Comparisons,vely applied, LCP followed by consistent block labeling provides a powerful tool for processing strings for a multitude of problems. In this paper we summarize applications of LCP in approximating well known distance measures between pairs of strings in (almost) linear time.
