標(biāo)題: Titlebook: Automata, Languages and Programming; 29th International C Peter Widmayer,Stephan Eidenbenz,Matthew Hennessy Conference proceedings 2002 Spr [打印本頁(yè)] 作者: mobility 時(shí)間: 2025-3-21 18:40
書(shū)目名稱(chēng)Automata, Languages and Programming影響因子(影響力)
書(shū)目名稱(chēng)Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Automata, Languages and Programming被引頻次
書(shū)目名稱(chēng)Automata, Languages and Programming被引頻次學(xué)科排名
書(shū)目名稱(chēng)Automata, Languages and Programming年度引用
書(shū)目名稱(chēng)Automata, Languages and Programming年度引用學(xué)科排名
書(shū)目名稱(chēng)Automata, Languages and Programming讀者反饋
書(shū)目名稱(chēng)Automata, Languages and Programming讀者反饋學(xué)科排名
作者: 切割 時(shí)間: 2025-3-21 22:03
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166194.jpg作者: 羊欄 時(shí)間: 2025-3-22 04:08
Gesundheitsberichterstattung in DeutschlandThe notion of . in mathematical structures is a powerful tool in many branches of mathematics. The talk presents an application of this notion to programming language theory.作者: 忘恩負(fù)義的人 時(shí)間: 2025-3-22 06:44
U. Laaser,P. Wolters,F. X. KaufmannIn this paper we consider the intersection-nonemptiness problem for languages given by regular expression without binary +. We prove that for regular expressions of star height 2 this problem is .-complete and it is .-complete for regular expressions of star height at most 1.作者: irritation 時(shí)間: 2025-3-22 10:37 作者: 薄荷醇 時(shí)間: 2025-3-22 15:45
Equivariant Syntax and SemanticsThe notion of . in mathematical structures is a powerful tool in many branches of mathematics. The talk presents an application of this notion to programming language theory.作者: AGATE 時(shí)間: 2025-3-22 20:24
Intersection of Regular Languages and Star HierarchyIn this paper we consider the intersection-nonemptiness problem for languages given by regular expression without binary +. We prove that for regular expressions of star height 2 this problem is .-complete and it is .-complete for regular expressions of star height at most 1.作者: 聰明 時(shí)間: 2025-3-22 23:16 作者: Fecal-Impaction 時(shí)間: 2025-3-23 03:35 作者: bile648 時(shí)間: 2025-3-23 09:32
Local and Global Methods in Data Mining: Basic Techniques and Open ProblemsData mining research can be divided into global approaches, which try to model the whole data, and local methods, which try to find useful patterns occurring in the data. We discuss briefly some simple local and global techniques, review two attempts at combining the approaches, and list open problems with an algorithmic flavor.作者: 慎重 時(shí)間: 2025-3-23 11:44 作者: 歡呼 時(shí)間: 2025-3-23 17:11 作者: Deadpan 時(shí)間: 2025-3-23 18:02
Automata, Languages and Programming978-3-540-45465-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 補(bǔ)助 時(shí)間: 2025-3-23 22:31 作者: Chagrin 時(shí)間: 2025-3-24 05:04
Grundlagen der Gesundheitspsychologiecterizing the computational complexity of combinatorial problems. However, due to their generality, these concepts have inherent limitations - they typically ignore the underlying structure and semantics of the problem instances. Thus they are generally not “robust” in terms of simultaneously classifying variants of the original problem.作者: G-spot 時(shí)間: 2025-3-24 09:09 作者: 機(jī)警 時(shí)間: 2025-3-24 14:28
Nico Vonneilich,Olaf von dem Knesebeckhe semantic approximations produced by such analyses have been traditionally applied to . during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program . and . [.,.,.].作者: Nefarious 時(shí)間: 2025-3-24 16:41
U. Laaser,P. Wolters,F.-X. Kaufmannarchy, including the block sizes and number of blocks at each level. The problems we consider are searching, partial persistence and planar point location. On a hierarchical memory where data is transferred in blocks of size ., some of the results we achieve are:作者: 壟斷 時(shí)間: 2025-3-24 22:11
https://doi.org/10.1007/3-540-45465-9Algorithmic Mathematics; Algorithms; Approximation; Automat; Complexity; Discrete Mathematics; Distributed作者: Interdict 時(shí)間: 2025-3-25 01:12 作者: GRATE 時(shí)間: 2025-3-25 07:09 作者: Parley 時(shí)間: 2025-3-25 10:30
Grundlagen der Gesundheitspsychologiecterizing the computational complexity of combinatorial problems. However, due to their generality, these concepts have inherent limitations - they typically ignore the underlying structure and semantics of the problem instances. Thus they are generally not “robust” in terms of simultaneously classi作者: 蚊帳 時(shí)間: 2025-3-25 14:02
Grundlagen der Gesundheitspsychologieproblem for deterministic pushdown automata: Given two languages .. and .. accepted by deterministic pushdown automata decide whether ..=... The problem was posed by S. Ginsburg and S. Greibach in 1966 and various subcases were shown to be decidable over years. However, the full question remained el作者: 過(guò)濾 時(shí)間: 2025-3-25 19:44
https://doi.org/10.1007/978-3-662-58314-2Data mining research can be divided into global approaches, which try to model the whole data, and local methods, which try to find useful patterns occurring in the data. We discuss briefly some simple local and global techniques, review two attempts at combining the approaches, and list open proble作者: bleach 時(shí)間: 2025-3-25 20:32 作者: 江湖騙子 時(shí)間: 2025-3-26 01:49
Gesundheitswissenschaften – eine Einführungquation is . if there is a setting of the variables to values in . so that the equality is realized. We study the problem of simultaneously satisfying a family of equations over a finite group . and show that it is .-hard to approximate the number of simultaneously satisfiable equations to within |.作者: 慎重 時(shí)間: 2025-3-26 07:41
Gesundheitswissenschaften – eine Einführungin .. log log .) time, where . and . are the number of edges & vertices, respectively. This is strictly faster than Johnson’s algorithm (for arbitrary edge-weights) and Dijkstra’s algorithm (for positive edge-weights) when . = .(. log .) and matches the running time of Hagerup’s APSP algorithm, whic作者: 使饑餓 時(shí)間: 2025-3-26 09:14 作者: 聽(tīng)寫(xiě) 時(shí)間: 2025-3-26 14:33
https://doi.org/10.1007/978-3-642-75091-5tsos, and Faloutsos, SIGCOMM 1999] based on a toy model of Internet growth in which two objectives are optimized simultaneously: “l(fā)ast mile” connection costs, and transmission delays measured in hops. We also point out a similar phenomenon, anticipated in [.], in the distribution of file sizes. Our 作者: 確認(rèn) 時(shí)間: 2025-3-26 19:22 作者: blister 時(shí)間: 2025-3-27 00:31
https://doi.org/10.1007/978-3-642-75091-5Such feedback is typically sent as control messages by receiver nodes. Since sending of control messages involves communication overhead, many protocols rely on aggregating a number of control messages and sending them together as a single packet over the network. On the other hand, the delays in th作者: 粗野 時(shí)間: 2025-3-27 03:53 作者: 生命 時(shí)間: 2025-3-27 08:48
U. Laaser,P. Wolters,F. X. Kaufmannffective construction of a reversible automaton for a reversible language was still unknown. We give in this paper a method to compute a reversible automaton from the minimal automaton of a reversible language. With this intention, we use the universal automaton of the language that can be obtained 作者: 嘲弄 時(shí)間: 2025-3-27 12:04 作者: Affection 時(shí)間: 2025-3-27 17:23
U. Laaser,P. Wolters,F.-X. Kaufmannarchy, including the block sizes and number of blocks at each level. The problems we consider are searching, partial persistence and planar point location. On a hierarchical memory where data is transferred in blocks of size ., some of the results we achieve are:作者: metropolitan 時(shí)間: 2025-3-27 19:08 作者: Transfusion 時(shí)間: 2025-3-27 22:06 作者: 烤架 時(shí)間: 2025-3-28 04:18 作者: 小爭(zhēng)吵 時(shí)間: 2025-3-28 08:30 作者: 青石板 時(shí)間: 2025-3-28 11:25 作者: Expostulate 時(shí)間: 2025-3-28 18:16
Molecular Assembly and Computation: From Theory to Experimental Demonstrationsomputer science with the development of its theoretical basis and a number of moderate to large-scale experimental demonstrations. This paper focuses on a subarea of Molecular Computation known as . Self-assembly is the spontaneous self-ordering of substructures into superstructures driven by the se作者: Delectable 時(shí)間: 2025-3-28 19:26
Towards a Predictive Computational Complexity Theorycterizing the computational complexity of combinatorial problems. However, due to their generality, these concepts have inherent limitations - they typically ignore the underlying structure and semantics of the problem instances. Thus they are generally not “robust” in terms of simultaneously classi作者: prick-test 時(shí)間: 2025-3-28 23:08
L(A) = L(B)? Decidability Results from Complete Formal Systemsproblem for deterministic pushdown automata: Given two languages .. and .. accepted by deterministic pushdown automata decide whether ..=... The problem was posed by S. Ginsburg and S. Greibach in 1966 and various subcases were shown to be decidable over years. However, the full question remained el作者: 環(huán)形 時(shí)間: 2025-3-29 03:55
Local and Global Methods in Data Mining: Basic Techniques and Open ProblemsData mining research can be divided into global approaches, which try to model the whole data, and local methods, which try to find useful patterns occurring in the data. We discuss briefly some simple local and global techniques, review two attempts at combining the approaches, and list open proble作者: 腐敗 時(shí)間: 2025-3-29 08:50
Program Debugging and Validation Using Semantic Approximations and Partial Specificationshe semantic approximations produced by such analyses have been traditionally applied to . during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program . and . [.,.,.].作者: Hectic 時(shí)間: 2025-3-29 13:03
Inapproximability Results for Equations over Finite Groupsquation is . if there is a setting of the variables to values in . so that the equality is realized. We study the problem of simultaneously satisfying a family of equations over a finite group . and show that it is .-hard to approximate the number of simultaneously satisfiable equations to within |.作者: Carminative 時(shí)間: 2025-3-29 16:47
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphsin .. log log .) time, where . and . are the number of edges & vertices, respectively. This is strictly faster than Johnson’s algorithm (for arbitrary edge-weights) and Dijkstra’s algorithm (for positive edge-weights) when . = .(. log .) and matches the running time of Hagerup’s APSP algorithm, whic作者: cruise 時(shí)間: 2025-3-29 21:14 作者: 大罵 時(shí)間: 2025-3-30 03:36
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internettsos, and Faloutsos, SIGCOMM 1999] based on a toy model of Internet growth in which two objectives are optimized simultaneously: “l(fā)ast mile” connection costs, and transmission delays measured in hops. We also point out a similar phenomenon, anticipated in [.], in the distribution of file sizes. Our 作者: Verify 時(shí)間: 2025-3-30 05:18
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game consisting of . parallel . We assume a collection of ., each employing a ., which is a probability distribution over links, to control the routing of its own assigned . In a ., each user selfishly routes its traffic on those links that minimize its ., given the network congestion caused by the othe作者: 壁畫(huà) 時(shí)間: 2025-3-30 09:07
Control Message Aggregation in Group Communication ProtocolsSuch feedback is typically sent as control messages by receiver nodes. Since sending of control messages involves communication overhead, many protocols rely on aggregating a number of control messages and sending them together as a single packet over the network. On the other hand, the delays in th作者: 藝術(shù) 時(shí)間: 2025-3-30 15:36
Church-Rosser Languages vs. UCFLroblem is solvable in polynomial time. In this paper we concentrate on the class of Church Rosser Languages (CRL), the “deterministic counterpart” of GCSL. We prove the conjecture (stated in [.] that the set of palindromes is not in CRL. This implies that CFL∩co-CFL as well as UCFL∩co-UCFL are not i作者: poliosis 時(shí)間: 2025-3-30 18:48
On the Construction of Reversible Automata for Reversible Languagesffective construction of a reversible automaton for a reversible language was still unknown. We give in this paper a method to compute a reversible automaton from the minimal automaton of a reversible language. With this intention, we use the universal automaton of the language that can be obtained 作者: Corral 時(shí)間: 2025-3-31 00:39
Priority Queues, Pairing, and Adaptive Sorting by Binomialsort, on an input sequence of length n that has . inversions, is at most 2.log./. + . [.]. The bound on the number of comparisons is further reduced to 1.89.log./. + . by using a new structure, which we call trinomial queues. The fact that the algorithm is simple and relies on fairly sim作者: 易于 時(shí)間: 2025-3-31 04:47 作者: 蟄伏 時(shí)間: 2025-3-31 08:52
U. Laaser,P. Wolters,F. X. Kaufmannfrom the minimal automaton and that contains an equivalent automaton which is quasi-reversible. This quasi-reversible automaton has nearly the same properties as a reversible one and can easily be turned into a reversible automaton.作者: 水槽 時(shí)間: 2025-3-31 12:32 作者: Employee 時(shí)間: 2025-3-31 17:07 作者: 宣傳 時(shí)間: 2025-3-31 20:42
https://doi.org/10.1007/978-3-642-75091-5 cost of control messages and the effect of delaying them..We develop a rigorous framework to study the aggregation of control packets for multicast and other hierarchical network protocols. We define the multicast aggregation problem and design efficient online algorithms for it, both centralized and distributed.作者: excursion 時(shí)間: 2025-3-31 23:11
L(A) = L(B)? Decidability Results from Complete Formal Systemsministic context-free languages, but also develops an entire machinery of new techniques which are likely to be useful in other contexts. They have already found useful in semantics of programming languages.作者: macular-edema 時(shí)間: 2025-4-1 05:51
Control Message Aggregation in Group Communication Protocols cost of control messages and the effect of delaying them..We develop a rigorous framework to study the aggregation of control packets for multicast and other hierarchical network protocols. We define the multicast aggregation problem and design efficient online algorithms for it, both centralized and distributed.作者: Immunoglobulin 時(shí)間: 2025-4-1 07:46 作者: hedonic 時(shí)間: 2025-4-1 11:16 作者: 不滿分子 時(shí)間: 2025-4-1 16:34
Setting Objectives for Public Healthe show that, when restricted to bounded tree-width, those graphs are isomorphic to hyperedge replacement equational graphs. Finally, we prove that on a wider family of graphs — interpretations of trees having a decidable monadic theory — the first order theory with reachability is decidable.作者: Definitive 時(shí)間: 2025-4-1 19:26 作者: 摻假 時(shí)間: 2025-4-1 22:50
https://doi.org/10.1007/978-3-642-75091-5GCSL. We prove the conjecture (stated in [.] that the set of palindromes is not in CRL. This implies that CFL∩co-CFL as well as UCFL∩co-UCFL are not included in CRL, where UCFL denotes the class of unambiguous context-free languages. Our proof uses a novel pumping technique, which is of independent interest.作者: Palter 時(shí)間: 2025-4-2 05:45
