標(biāo)題: Titlebook: Descriptional Complexity of Formal Systems; 15th International W Helmut Jurgensen,Rogério Reis Conference proceedings 2013 Springer-Verlag [打印本頁(yè)] 作者: ARRAY 時(shí)間: 2025-3-21 16:27
書(shū)目名稱Descriptional Complexity of Formal Systems影響因子(影響力)
書(shū)目名稱Descriptional Complexity of Formal Systems影響因子(影響力)學(xué)科排名
書(shū)目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Descriptional Complexity of Formal Systems被引頻次
書(shū)目名稱Descriptional Complexity of Formal Systems被引頻次學(xué)科排名
書(shū)目名稱Descriptional Complexity of Formal Systems年度引用
書(shū)目名稱Descriptional Complexity of Formal Systems年度引用學(xué)科排名
書(shū)目名稱Descriptional Complexity of Formal Systems讀者反饋
書(shū)目名稱Descriptional Complexity of Formal Systems讀者反饋學(xué)科排名
作者: LAIR 時(shí)間: 2025-3-21 22:22 作者: elucidate 時(shí)間: 2025-3-22 04:07 作者: Digest 時(shí)間: 2025-3-22 07:45 作者: GOAT 時(shí)間: 2025-3-22 09:42 作者: 直覺(jué)沒(méi)有 時(shí)間: 2025-3-22 14:41 作者: 直覺(jué)沒(méi)有 時(shí)間: 2025-3-22 17:56
Glass Fiber Reinforced Polymers,chagin and Vitányi, we know that sophistication and naive sophistication are equivalent up to low order terms. We use this to relate sophistication to lossy compression, and to derive an alternative formulation for busy beaver computational depth.作者: Obligatory 時(shí)間: 2025-3-23 00:10
State Complexity of ,-Union and ,-Intersection for Prefix-Free Regular Languages,ry alphabet. We prove that the state complexity upper bound for .-union cannot be reached by languages over an alphabet with less than . symbols. We also give a lower bound construction for .-union using a binary alphabet that is within a constant factor of the upper bound.作者: 硬化 時(shí)間: 2025-3-23 02:40
Queue Automata of Constant Length,ata paying only by a linear size increase, and that removing nondeterminism in constant length queue automata requires an optimal exponential size blow-up, against the optimal double-exponential cost for determinizing constant height pushdown automata.作者: 水獺 時(shí)間: 2025-3-23 06:32 作者: 禍害隱伏 時(shí)間: 2025-3-23 13:09
William L. Jaffe MD,Harlan B. Levine MDtransitions in a minimal finite automaton accepting a regular language, and apparently, this number has no connection to Chaitin-Kolmogorov complexity. In this paper we establish such a connection by extending the notions of Blum static complexity and of encoded function space.作者: 孵卵器 時(shí)間: 2025-3-23 14:12
Glass Fiber Reinforced Polymers,sions, and syntactic monoids. It turns out that as in the case of ordinary finite automata nondeterministic biautomata are superior to biautomata with respect to their relative succinctness in representing regular languages.作者: ANTH 時(shí)間: 2025-3-23 18:20
https://doi.org/10.1007/978-3-319-78766-4regular languages over an (.???2)-element alphabet and a few tight bounds for binary .-trivial regular languages. The case of .-trivial regular languages over an (.???.)-element alphabet, for 2?≤?.?≤?.???3, is open.作者: 絆住 時(shí)間: 2025-3-23 22:14
Blum Static Complexity and Encoding Spaces,transitions in a minimal finite automaton accepting a regular language, and apparently, this number has no connection to Chaitin-Kolmogorov complexity. In this paper we establish such a connection by extending the notions of Blum static complexity and of encoded function space.作者: Estrogen 時(shí)間: 2025-3-24 06:14
Nondeterministic Biautomata and Their Descriptional Complexity,sions, and syntactic monoids. It turns out that as in the case of ordinary finite automata nondeterministic biautomata are superior to biautomata with respect to their relative succinctness in representing regular languages.作者: 監(jiān)禁 時(shí)間: 2025-3-24 09:50
On the State Complexity of the Reverse of ,- and ,-Trivial Regular Languages,regular languages over an (.???2)-element alphabet and a few tight bounds for binary .-trivial regular languages. The case of .-trivial regular languages over an (.???.)-element alphabet, for 2?≤?.?≤?.???3, is open.作者: Relinquish 時(shí)間: 2025-3-24 13:58 作者: 詳細(xì)目錄 時(shí)間: 2025-3-24 18:28 作者: 減少 時(shí)間: 2025-3-24 22:20 作者: 易受騙 時(shí)間: 2025-3-25 01:44 作者: Communal 時(shí)間: 2025-3-25 06:03 作者: airborne 時(shí)間: 2025-3-25 10:00 作者: Offensive 時(shí)間: 2025-3-25 13:48
Kevlar and Other Aramid Fibers,ry alphabet. We prove that the state complexity upper bound for .-union cannot be reached by languages over an alphabet with less than . symbols. We also give a lower bound construction for .-union using a binary alphabet that is within a constant factor of the upper bound.作者: SUE 時(shí)間: 2025-3-25 19:08 作者: ECG769 時(shí)間: 2025-3-25 22:51
https://doi.org/10.1007/978-3-642-39310-5context-free languages; descriptional complexity; finite automata; regular expressions; turing machines; 作者: 漂泊 時(shí)間: 2025-3-26 04:12
978-3-642-39309-9Springer-Verlag Berlin Heidelberg 2013作者: Gesture 時(shí)間: 2025-3-26 06:38
William L. Jaffe MD,Harlan B. Levine MDnimal description length [14, 17]. This concept was extended in 2012 in two papers, each using a different approach. One of the papers studies properties of the complexity function, and uses the notion of encoded function space; the other one extends Blum axioms for static complexity, and defines Bl作者: nocturnal 時(shí)間: 2025-3-26 12:23
William L. Jaffe MD,Harlan B. Levine MDo engage in such a communication with human beings without them being able to identify the computer, the computer should be considered to be intelligent. Although it is debatable whether this conclusion could really be drawn from the Turing test (see also [6]), it shows how complex human language is作者: Landlocked 時(shí)間: 2025-3-26 15:54
Giorgio Ausiello,Juhani Karhum?ki,Luke Ongdo simple things like integer arithmetic and matrix multiplication, but . turns sullen and calls for help when asked to perform seemingly equally simple tasks, such as simulating deterministic tree and dag automata..Is . acting difficult or is she just not smart enough?.Even before the . versus . qu作者: armistice 時(shí)間: 2025-3-26 16:47 作者: 創(chuàng)作 時(shí)間: 2025-3-26 21:43
https://doi.org/10.1007/978-3-319-78766-4e any in-transitions. We establish the precise state complexity of four Boolean operations (union, intersection, difference, symmetric difference), catenation, reversal, and Kleene-star for non-returning regular languages. Our results are usually smaller than the state complexities for general regul作者: 同謀 時(shí)間: 2025-3-27 01:31 作者: 恃強(qiáng)凌弱 時(shí)間: 2025-3-27 06:33
Kevlar and Other Aramid Fibers,te automata have their own unique structural properties that are crucial for obtaining state complexity upper bounds that are improved from those for general regular languages. We present a tight lower bound construction for .-union using an alphabet of size .?+?1 and for .-intersection using a bina作者: 嚙齒動(dòng)物 時(shí)間: 2025-3-27 11:32
https://doi.org/10.1007/978-3-319-78766-4a number of states which is quadratic in the number of states and linear in the number of pushdown symbols of the given PDA. Moreover, we prove the size optimality of our construction. Beside improving some results in the literature, our approach represents an alternative and more direct proof of pu作者: 爭(zhēng)吵 時(shí)間: 2025-3-27 17:14
https://doi.org/10.1007/978-3-319-78766-4 and a characterization of removal operations that preserve regularity is known. We consider the nondeterministic state complexity of the operation . and, more generally, of polynomial removals as defined by Domaratzki (. 7(4), 2002). We give an .(..) upper bound for the nondeterministic state compl作者: 流動(dòng)才波動(dòng) 時(shí)間: 2025-3-27 18:24
Glass Fiber Reinforced Polymers,eaking, biautomata are finite automata reading the input from both sides; although the head movement is nondeterministic, additional requirements enforce biautomata to work deterministically. First we study the size blow-up when determinizing nondeterministic biautomata. Further, we give tight bound作者: 痛得哭了 時(shí)間: 2025-3-27 22:49 作者: Angioplasty 時(shí)間: 2025-3-28 05:37
https://doi.org/10.1007/978-3-319-78766-4rnary for .-trivial regular languages and (.???1)-ary for .-trivial regular languages. In this paper, we prove that the bound can be met neither by a binary .-trivial regular language nor by a .-trivial regular language over an (.???2)-element alphabet. We provide a characterization of tight bounds 作者: glowing 時(shí)間: 2025-3-28 10:06
Glass Fiber Reinforced Polymers,eficiency. Naive sophistication measures the minimum number of bits needed to specify a set in which the string is a typical element. Thanks to Vereshchagin and Vitányi, we know that sophistication and naive sophistication are equivalent up to low order terms. We use this to relate sophistication to作者: 是貪求 時(shí)間: 2025-3-28 11:52 作者: 可耕種 時(shí)間: 2025-3-28 15:06 作者: mighty 時(shí)間: 2025-3-28 18:53 作者: Tempor 時(shí)間: 2025-3-29 02:41 作者: Erythropoietin 時(shí)間: 2025-3-29 04:37 作者: 改革運(yùn)動(dòng) 時(shí)間: 2025-3-29 09:06
Invertible Transductions and Iteration,We study iterated transductions, where the basic transductions are given by a class of length-preserving invertible transducers over the binary alphabet. It is shown that in some cases the resulting orbit relation is rational and we determine the complexity of several natural computational problems associated with the iterated transductions.作者: 小畫(huà)像 時(shí)間: 2025-3-29 12:36 作者: 格子架 時(shí)間: 2025-3-29 16:55 作者: 加強(qiáng)防衛(wèi) 時(shí)間: 2025-3-29 20:44
Shortest Repetition-Free Words Accepted by Automata,We consider the following problem: given that a finite automaton . of . states accepts at least one .-power-free (resp., overlap-free) word, what is the length of the shortest such word accepted? We give upper and lower bounds which, unfortunately, are widely separated.作者: FELON 時(shí)間: 2025-3-30 00:52 作者: Foment 時(shí)間: 2025-3-30 05:49
Fifty Years of Cytochrome P450 Researchjections . are accepted by nondeterministic finite automata of size polynomial in .. Therefore, proving super-polynomial lower bounds for . reduces to proving super-polynomial lower bounds for . i.e. nondeterministic finite automata.作者: 怒目而視 時(shí)間: 2025-3-30 09:25 作者: Friction 時(shí)間: 2025-3-30 13:35 作者: 使激動(dòng) 時(shí)間: 2025-3-30 17:27
A Characterisation of ,/, via Nondeterministic Finite Automata,jections . are accepted by nondeterministic finite automata of size polynomial in .. Therefore, proving super-polynomial lower bounds for . reduces to proving super-polynomial lower bounds for . i.e. nondeterministic finite automata.作者: 合適 時(shí)間: 2025-3-30 23:22 作者: CRUE 時(shí)間: 2025-3-31 01:27
Can Chimps Go It Alone?,n explicit function .:.×.?→?. is prescribed at each internal node. In a nutshell, lower bounds for restricted branching programs can be proved, but approaches to attack the general model strangely come up against the same barrier that Nec?iporuk encountered in a two-page note 50 years ago and that s作者: 發(fā)酵劑 時(shí)間: 2025-3-31 07:04
0302-9743 deling natural languages; complexity aspects related to the combinatorics of words; descriptional complexity in resource-bounded or structure-bounded environments; structural complexity as related to descriptional complexity; frontiers b978-3-642-39309-9978-3-642-39310-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: grandiose 時(shí)間: 2025-3-31 12:08 作者: 使害怕 時(shí)間: 2025-3-31 16:34 作者: LUCY 時(shí)間: 2025-3-31 19:33 作者: 新陳代謝 時(shí)間: 2025-3-31 22:47 作者: 一瞥 時(shí)間: 2025-4-1 03:30 作者: 裝入膠囊 時(shí)間: 2025-4-1 06:48 作者: 影響深遠(yuǎn) 時(shí)間: 2025-4-1 11:58
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Starymmetric differences and differences of two languages, one or both of which are starred, and for the product of two starred languages. We prove that the previously discovered bounds for the union and the intersection of languages with one or two starred arguments, for the product of two languages on作者: 中古 時(shí)間: 2025-4-1 15:02 作者: 粗野 時(shí)間: 2025-4-1 18:31
State Complexity of Subtree-Free Regular Tree Languages,free regular tree languages. The state complexity of an operation for regular tree languages is the number of states that are sufficient and necessary in the worst-case for the minimal deterministic ranked tree automaton that accepts the tree language obtained from the operation. We establish the pr
