標(biāo)題: Titlebook: Developments in Language Theory; 17th International C Marie-Pierre Béal,Olivier Carton Conference proceedings 2013 Springer-Verlag Berlin H [打印本頁] 作者: PEL 時間: 2025-3-21 16:54
書目名稱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é)科排名
作者: –FER 時間: 2025-3-21 22:44
0302-9743 y and logic; picture description and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; cellular automata; bio-inspired computing; and quantum computing.978-3-642-38770-8978-3-642-38771-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 歪曲道理 時間: 2025-3-22 02:36
Abhandlungen zur Literaturwissenschafttiset of Lyndon words. Finally, we show that the Lyndon factorization of a word helps the construction of its suffix array, allowing a reduction of the number of symbol comparisons needed to lexicographically sort the suffixes of the word.作者: 必死 時間: 2025-3-22 08:05 作者: 臨時抱佛腳 時間: 2025-3-22 12:02
Einige Grundbegriffe der Analysis im ?Straight-Line Programme) for the solution of the word equation, i.e. a ...Using this technique we give a simple proof that satisfiability of word equations is in .. Furthermore we sketch the applications for some problems regarding the SLP compressed strings.作者: 服從 時間: 2025-3-22 15:13 作者: 服從 時間: 2025-3-22 19:16 作者: 燦爛 時間: 2025-3-22 22:45 作者: LUCY 時間: 2025-3-23 05:19
An Explicit Formula for the Intersection of Two Polynomials of Regular Languagese same purpose, our formula does not use complementation and only requires union, intersection and quotients. Our result also implies that if . is closed under union, intersection and quotient, then its polynomial closure, its unambiguous polynomial closure and its left [right] deterministic polynomial closure are closed under the same operations.作者: hieroglyphic 時間: 2025-3-23 06:22
Two Dimensional Prefix Codes of Picturesrther a polynomial time decoding algorithm for finite prefix codes is given. Maximality and completeness of finite prefix codes are studied: differently from the one-dimensional case, they are not equivalent notions. Completeness of finite prefix codes is characterized.作者: malign 時間: 2025-3-23 09:57
H?here Mathematik mit Mathematicathis talk is to survey some classical and some more recent results on unambiguous finite automata over different kind of input structures, namely finite words, infinite words, finite trees, and infinite trees.作者: cacophony 時間: 2025-3-23 15:06
H?here Mathematik mit MathematicaMPDSs, called Adjacent OMPDSs (AOMPDS), where values may be pushed only on the lowest non-empty stack or one of its two neighbours. We describe . decision procedures for reachability and LTL model-checking, establish matching lower bounds and describe two applications of this model.作者: 注視 時間: 2025-3-23 21:54
H?here Mathematik mit Mathematicathe class of languages that can be defined beyond the regular, but they allow for exponentially more succinct representation of some languages. Membership testing remains polynomial, but emptiness testing becomes PSPACE-hard.作者: 功多汁水 時間: 2025-3-24 01:03
Zur Geschichte des H?lderlinschen Nachlassesds of binary pure morphic words are morphic. Our technique also yields easy characterizations of extremal words of the Period-doubling and Chacon words and a new proof of the form of the lexicographically least word in the shift orbit closure of the Rudin-Shapiro word.作者: 該得 時間: 2025-3-24 03:44 作者: 善變 時間: 2025-3-24 08:21
Abhandlungen zur Literaturwissenschaftlish a learning algorithm to infer session automata through membership and equivalence queries. Finally, we strengthen the robustness of our automaton by its characterization in monadic second-order logic.作者: concentrate 時間: 2025-3-24 13:56
Rousseau, Schiller, Herder, Heinse the word equations involved in dealing with the Dual PCP. Our approach yields large sets of words for which there exists a solution to the Dual PCP as well as examples of words over arbitrary alphabets for which such a solution does not exist.作者: 構(gòu)成 時間: 2025-3-24 16:32 作者: stress-response 時間: 2025-3-24 19:06 作者: 姑姑在炫耀 時間: 2025-3-25 01:38 作者: fertilizer 時間: 2025-3-25 04:19
On the Dual Post Correspondence Problem the word equations involved in dealing with the Dual PCP. Our approach yields large sets of words for which there exists a solution to the Dual PCP as well as examples of words over arbitrary alphabets for which such a solution does not exist.作者: Lacunar-Stroke 時間: 2025-3-25 10:20 作者: EXULT 時間: 2025-3-25 12:45
Conference proceedings 2013oblems; relationships to complexity theory and logic; picture description and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; cellular automata; bio-inspired computing; and quantum computing.作者: febrile 時間: 2025-3-25 17:15
Unambiguous Finite Automatathis talk is to survey some classical and some more recent results on unambiguous finite automata over different kind of input structures, namely finite words, infinite words, finite trees, and infinite trees.作者: 下邊深陷 時間: 2025-3-25 20:15
Adjacent Ordered Multi-Pushdown SystemsMPDSs, called Adjacent OMPDSs (AOMPDS), where values may be pushed only on the lowest non-empty stack or one of its two neighbours. We describe . decision procedures for reachability and LTL model-checking, establish matching lower bounds and describe two applications of this model.作者: 不愿 時間: 2025-3-26 00:17
Cuts in Regular Expressionsthe class of languages that can be defined beyond the regular, but they allow for exponentially more succinct representation of some languages. Membership testing remains polynomial, but emptiness testing becomes PSPACE-hard.作者: 胰島素 時間: 2025-3-26 04:36 作者: 天真 時間: 2025-3-26 09:05
Conference proceedings 2013ce, in June 2013. The 34 full papers presented in this volume were carefully reviewed and selected from 63 submissions. The scope of the conference includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transduce作者: Pedagogy 時間: 2025-3-26 14:37
Einige Grundbegriffe der Analysis im ? . by . or .) and replacement of pairs of letters appearing in the equation by a ‘fresh’ letter, which can be seen as a bottom-up building of an SLP (Straight-Line Programme) for the solution of the word equation, i.e. a ...Using this technique we give a simple proof that satisfiability of word equa作者: Phonophobia 時間: 2025-3-26 19:24
H?here Mathematik mit Mathematicaould say. A mathematician would say that they characterize the asymptotic behavior of a semigroup of matrices, and a computer scientist would perhaps see them as describing languages generated by automata.作者: abysmal 時間: 2025-3-26 22:28
H?here Mathematik mit Mathematicach input is accepted by at most one run or computation. Each deterministic automaton is obviously unambiguous. However, in many settings, unambiguous automata are more expressive or admit more succinct automata than deterministic models, while preserving some good algorithmic properties. The aim of 作者: 提煉 時間: 2025-3-27 02:48 作者: ARIA 時間: 2025-3-27 08:39 作者: Ordnance 時間: 2025-3-27 12:31 作者: 責(zé)任 時間: 2025-3-27 16:31
H?here Mathematik mit Mathematicasection, complementation, and interleaving. Some of the most popular engines, for example those of Java and Perl, also provide operators that are intended to control the nondeterminism inherent in regular expressions. We formalize this notion in the form of the . and . operators. They do not extend 作者: 帶傷害 時間: 2025-3-27 19:02 作者: Obstacle 時間: 2025-3-28 00:27 作者: Ergots 時間: 2025-3-28 03:24
https://doi.org/10.1007/978-3-663-02571-9 with . distinct variables of length at least 2. is avoidable over a ternary alphabet. Building upon the work of Rampersad and the power series techniques of Bell and Goh, we obtain both of these suggested strict bounds. Similar bounds are also obtained for pattern avoidance in partial words, sequen作者: 強行引入 時間: 2025-3-28 07:30 作者: 退出可食用 時間: 2025-3-28 10:38 作者: colloquial 時間: 2025-3-28 18:10 作者: 無聊的人 時間: 2025-3-28 21:32 作者: llibretto 時間: 2025-3-29 02:36 作者: Blanch 時間: 2025-3-29 03:57
Frankreich (Dezember 1801 – Juni 1802) form the algebraic structure of a semiring, but recently also other weight computations like average have been considered. Here, we investigate quantitative context-free languages over very general weight structures incorporating all semirings, average computations, lattices. In our main result, we作者: 性別 時間: 2025-3-29 09:12
Marie-Pierre Béal,Olivier CartonConference proceedings of the International Conference on Developments in Language Theory, DLT 2013作者: echnic 時間: 2025-3-29 13:41
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/270243.jpg作者: 字謎游戲 時間: 2025-3-29 18:22
https://doi.org/10.1007/978-3-642-38771-5alphabet; context-free languages; finite automata; regular expressions; regular languages; algorithm anal作者: Ostrich 時間: 2025-3-29 21:54
978-3-642-38770-8Springer-Verlag Berlin Heidelberg 2013作者: avulsion 時間: 2025-3-30 03:26
Developments in Language Theory978-3-642-38771-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 尖牙 時間: 2025-3-30 07:01 作者: Stagger 時間: 2025-3-30 10:51 作者: commensurate 時間: 2025-3-30 14:51 作者: adequate-intake 時間: 2025-3-30 18:21
https://doi.org/10.1007/978-3-476-04878-3es. We prove that, for any .?>?0, the probability that this number of states is greater than .. tends to 1 as . tends to infinity. As a consequence, the generic and average complexities of Brzozowski minimization algorithm are super-polynomial for the uniform distribution on deterministic automata.作者: Affluence 時間: 2025-3-30 23:21
Joint Spectral Characteristics: A Tale of Three Disciplinesould say. A mathematician would say that they characterize the asymptotic behavior of a semigroup of matrices, and a computer scientist would perhaps see them as describing languages generated by automata.作者: NIP 時間: 2025-3-31 01:10 作者: 思想 時間: 2025-3-31 08:56 作者: 喧鬧 時間: 2025-3-31 11:39 作者: 迫擊炮 時間: 2025-3-31 16:50 作者: 收藏品 時間: 2025-3-31 17:36
Frankreich (Dezember 1801 – Juni 1802)We introduce the inner palindromic closure as a new operation ., which consists in expanding a factor . to the left or right by . such that . or ., respectively, is a palindrome of minimal length. We investigate several language theoretic properties of the iterated inner palindromic closure . of a word ..作者: 使成核 時間: 2025-4-1 00:35
Rousseau, Schiller, Herder, HeinseWe consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word ., does there exist a finite coloring of its factors such that no factorization of . is monochromatic? We show that such a coloring always exists whenever . is a Sturmian word or a standard episturmian word.作者: 慢跑鞋 時間: 2025-4-1 05:41 作者: Anterior 時間: 2025-4-1 09:37 作者: 琺瑯 時間: 2025-4-1 11:18
