標(biāo)題: Titlebook: Development in Language Theory; 15th International C Giancarlo Mauri,Alberto Leporati Conference proceedings 2011 Springer-Verlag GmbH Berl [打印本頁] 作者: Hermit 時間: 2025-3-21 19:59
書目名稱Development in Language Theory影響因子(影響力)
書目名稱Development in Language Theory影響因子(影響力)學(xué)科排名
書目名稱Development in Language Theory網(wǎng)絡(luò)公開度
書目名稱Development in Language Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Development in Language Theory被引頻次
書目名稱Development in Language Theory被引頻次學(xué)科排名
書目名稱Development in Language Theory年度引用
書目名稱Development in Language Theory年度引用學(xué)科排名
書目名稱Development in Language Theory讀者反饋
書目名稱Development in Language Theory讀者反饋學(xué)科排名
作者: 啟發(fā) 時間: 2025-3-22 00:09
Tatyana B. Ruseva,Burnell C. Fischerther there is a general algorithm for state complexity, and whether there is a new approach in this area of research. The new concept of state complexity approximation is also discussed. We show that this new concept can be used to obtain good results when the exact state complexities are difficult to find.作者: Angioplasty 時間: 2025-3-22 03:59
Arturo Pizano,Alfonso Cardenas,Allen Klingerg of the current content of its tape or replace a substring by a special auxiliary symbol Δ, which cannot be overwritten anymore, but it can be deleted later. The main result of this paper consists in proving that besides their limited operations, Δ-clearing restarting automata recognize all context-free languages.作者: 女上癮 時間: 2025-3-22 06:00 作者: CYN 時間: 2025-3-22 09:28 作者: Affable 時間: 2025-3-22 16:01 作者: Affable 時間: 2025-3-22 18:13
Emotion Recognition and Its ApplicationsThe notion of redundancies in texts, regarded as sequences of symbols, appear under various concepts in the literature of Combinatorics on words and of Algorithms on strings: repetitions, repeats, runs, covers, seeds, and palindromes, for example..We explore some of the newest aspects of these redundancies.作者: 臭名昭著 時間: 2025-3-23 01:01 作者: 斑駁 時間: 2025-3-23 01:38 作者: 刀鋒 時間: 2025-3-23 08:47
Scattered Context-Free Linear OrderingsWe show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.作者: 責(zé)怪 時間: 2025-3-23 12:57 作者: 有發(fā)明天才 時間: 2025-3-23 17:03 作者: 假設(shè) 時間: 2025-3-23 20:39 作者: 準(zhǔn)則 時間: 2025-3-24 00:05 作者: Ventilator 時間: 2025-3-24 03:09
Abelian Primitive Wordse can determine whether a word is Abelian primitive in linear time. Also different from classical primitive words, we find that a word may have more than one Abelian root. We also consider enumeration of Abelian primitive words.作者: 邊緣帶來墨水 時間: 2025-3-24 08:33
Emotion Recognition and Its Applications0]). Indeed, a well known technique to minimize a DFA, essentially, consists in finding pairs of states that are equivalent (or .), namely pairs of states (.,.) such that it is impossible to assert the difference between . and . only by starting in each of the two states and asking whether or not a 作者: 協(xié)迫 時間: 2025-3-24 12:39
Tatyana B. Ruseva,Burnell C. Fischer. The first line, originated by Thue in 1906, concerns about . words and languages. The second line is the study of . for words and languages; it can be traced back to the classical papers by Morse and Hedlund on symbolic dynamics (1938, 1940). Growth functions of repetition-free languages are inves作者: 懶惰人民 時間: 2025-3-24 15:12
https://doi.org/10.1007/978-94-007-4780-7by Ken Thompson—, are one of the major achievements of formal language and automata theory. Google counts 303,000 results for “regular expressions matching” (May?4, 2011); there are numerous command line tools for working with regular expressions such as grep; Google released a regular expression C+作者: JECT 時間: 2025-3-24 23:04 作者: originality 時間: 2025-3-25 01:55 作者: Insatiable 時間: 2025-3-25 06:23 作者: 言行自由 時間: 2025-3-25 09:08
https://doi.org/10.1007/978-94-007-2825-7. In search for understanding the class of finite splicing systems, it has been conjectured that a necessary condition for a regular language . to be a splicing language is that . must have a constant in the Schützenberger’s sense. We prove this longstanding conjecture to be true. The result is base作者: Gnrh670 時間: 2025-3-25 12:04
The Value Space of Meaningful Relationsnsition complexity, is studied. The average transition complexity of . was proved by Nicaud to be linear in the size of the corresponding expression. This result was obtained using an upper bound of the number of transitions of .. Here we present a new quadratic construction of . that leads to a mor作者: Kindle 時間: 2025-3-25 19:07 作者: 思想 時間: 2025-3-25 23:09 作者: 慢慢流出 時間: 2025-3-26 01:46 作者: affect 時間: 2025-3-26 05:14 作者: 使害怕 時間: 2025-3-26 11:19 作者: Meager 時間: 2025-3-26 13:55 作者: CROAK 時間: 2025-3-26 17:39
https://doi.org/10.1007/978-1-4684-5883-1s in turn. A game is specified by the .-language which contains the plays won by Player 2. We analyze .-languages generated from certain classes . of regular languages of finite words (called *-languages), using natural transformations of *-languages into .-languages. Winning strategies for infinite作者: 外觀 時間: 2025-3-26 22:52
Johannes Herbeck,Rapti Siriwardane-de Zoysads due to a length function. The length function, however, takes values in the additive group of polynomials ?[t] (and not, as traditionally, in ?), which yields various new properties. Non-Archimedean words allow to solve a number of algorithmic problems in geometric and algorithmic group theory. T作者: 成績上升 時間: 2025-3-27 04:33 作者: 預(yù)示 時間: 2025-3-27 07:02
Conference proceedings 2011f words and languages; decidability questions; applications of language theory, including: natural computing, image manipulation and compression, text algorithms, cryptography, concurrency, complexity theory and logic; cellular automata and multidimensional patterns; language theory aspects of quantum computing and bio-computing.作者: expire 時間: 2025-3-27 12:57 作者: 笨拙的你 時間: 2025-3-27 17:41 作者: 脖子 時間: 2025-3-27 19:35
Growth Properties of Power-Free Languagess to some natural unsolved problems. Also, we pay attention to the tools and techniques that made possible the progress in the area and suggest some technical results that would be useful to solve open problems.作者: 兇殘 時間: 2025-3-27 21:58
The Average Transition Complexity of Glushkov and Partial Derivative Automata upper bound for the ratio of the number of states of . to the number of states of ., which is about . for large alphabet sizes. Here we show how to obtain an upper bound for the number of transitions in ., which we then use to get an average case approximation. Some experimental results are presented that illustrate the quality of our estimate.作者: defray 時間: 2025-3-28 02:28 作者: NEXUS 時間: 2025-3-28 09:51 作者: 散步 時間: 2025-3-28 12:11 作者: Servile 時間: 2025-3-28 18:22 作者: Defiance 時間: 2025-3-28 20:39
https://doi.org/10.1007/978-3-319-30334-5xity of right ideals and prefix-closed languages, and that there exist left ideals and suffix-closed languages of syntactic complexity ..?+?.???1, and two-sided ideals and factor-closed languages of syntactic complexity ..?+?(.???2)2.?+?1.作者: landmark 時間: 2025-3-28 22:55 作者: 高深莫測 時間: 2025-3-29 06:00 作者: 粉筆 時間: 2025-3-29 07:14 作者: Prostaglandins 時間: 2025-3-29 13:19 作者: 先兆 時間: 2025-3-29 18:01
User Generated Dialogue Systems: uDialogue,in this class of languages. Then we prove the existence of a unique maximal autosimulation relation in a given 2OTA and the existence of a unique minimal 2OTA which is simulation equivalent to this given 2OTA, both computable in polynomial time.作者: 偶像 時間: 2025-3-29 21:58 作者: FLIRT 時間: 2025-3-30 02:05
Avoiding Abelian Powers in Partial Wordsabelian .-free partial words of length . with . holes over a given alphabet grows exponentially as . increases. Finally, we prove that we cannot avoid abelian .th powers under arbitrary insertion of holes in an infinite word.作者: Loathe 時間: 2025-3-30 07:51
Simulations over Two-Dimensional On-Line Tessellation Automatain this class of languages. Then we prove the existence of a unique maximal autosimulation relation in a given 2OTA and the existence of a unique minimal 2OTA which is simulation equivalent to this given 2OTA, both computable in polynomial time.作者: Leaven 時間: 2025-3-30 10:16 作者: 食品室 時間: 2025-3-30 12:38 作者: 指耕作 時間: 2025-3-30 18:20 作者: 拋射物 時間: 2025-3-30 22:17 作者: Gourmet 時間: 2025-3-31 04:56
Languages vs. ,-Languages in Regular Infinite Games games can be represented again in terms of *-languages. Continuing work of Selivanov (2007) and Rabinovich et al. (2007), we analyze how these “strategy *-languages” are related to the original language class .. In contrast to that work, we exhibit classes . where strategy representations strictly exceed ..作者: cravat 時間: 2025-3-31 05:17 作者: 名義上 時間: 2025-3-31 10:51 作者: 反對 時間: 2025-3-31 14:37 作者: Virtues 時間: 2025-3-31 17:52 作者: 障礙 時間: 2025-3-31 23:31 作者: 表皮 時間: 2025-4-1 02:57 作者: 評論者 時間: 2025-4-1 07:07
