標(biāo)題: Titlebook: Language and Automata Theory and Applications; 7th International Co Adrian-Horia Dediu,Carlos Martín-Vide,Bianca Truth Conference proceedin [打印本頁(yè)] 作者: FLAW 時(shí)間: 2025-3-21 16:08
書目名稱Language and Automata Theory and Applications影響因子(影響力)
書目名稱Language and Automata Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Language and Automata Theory and Applications被引頻次
書目名稱Language and Automata Theory and Applications被引頻次學(xué)科排名
書目名稱Language and Automata Theory and Applications年度引用
書目名稱Language and Automata Theory and Applications年度引用學(xué)科排名
書目名稱Language and Automata Theory and Applications讀者反饋
書目名稱Language and Automata Theory and Applications讀者反饋學(xué)科排名
作者: 萬(wàn)靈丹 時(shí)間: 2025-3-21 21:38 作者: GOAT 時(shí)間: 2025-3-22 02:36 作者: Oration 時(shí)間: 2025-3-22 05:57 作者: 支形吊燈 時(shí)間: 2025-3-22 10:59
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problemith an arbitrary number of holes of length . over a fixed alphabet by modifying Weiner’s algorithm. Our algorithm also computes the lccp array between suffixes of . starting with holes and all other suffixes of .. It possesses the invariant that after the suffix at position . has been processed, the作者: 宣傳 時(shí)間: 2025-3-22 14:15
Conference proceedings 2013decidability questions on words and languages; descriptional complexity; DNA and other models of bio-inspired computing; document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammars (Chomsky hierarchy, contextual, multidimensional, unification作者: 民間傳說 時(shí)間: 2025-3-22 19:29
0302-9743 mplexity; DNA and other models of bio-inspired computing; document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammars (Chomsky hierarchy, contextual, multidimensional, unification978-3-642-37063-2978-3-642-37064-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Entreaty 時(shí)間: 2025-3-22 21:50 作者: 叢林 時(shí)間: 2025-3-23 04:50 作者: Ige326 時(shí)間: 2025-3-23 08:28 作者: inchoate 時(shí)間: 2025-3-23 10:33
Jean-Marc Champarnaud,Jean-Philippe Dubernard,Hadrien Jeanne,Ludovic Mignot作者: 為寵愛 時(shí)間: 2025-3-23 14:08 作者: 阻礙 時(shí)間: 2025-3-23 18:32
Unambiguous Automata Denoting Finitely Sequential Functionsanswer is positive. To this end, we introduce the Fork Property which plays the same role as the negation of the Twin Property in case of determinisation. We show that an unambiguous automaton can be transformed into a finitely sequential one if and only if the Fork Property is not satisfied.作者: 敵手 時(shí)間: 2025-3-24 02:01 作者: 任命 時(shí)間: 2025-3-24 02:52 作者: 幻影 時(shí)間: 2025-3-24 09:28
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systemsy the computational complexity of, analysis and verification problems for classes of finitely-presented infinite-state probabilistic systems that arise as probabilistic extensions to classic infinite-state automata-theoretic models.作者: 木訥 時(shí)間: 2025-3-24 11:53 作者: 自戀 時(shí)間: 2025-3-24 18:30
0302-9743 national Conference on Language and Automata Theory and Applications, LATA 2013, held in Bilbao, Spain in April 2013. .The 45 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 97 initial submissions. The volume features contributions from both clas作者: spinal-stenosis 時(shí)間: 2025-3-24 22:32 作者: 中止 時(shí)間: 2025-3-25 00:04
Termination of Rule-Based Calculi for Uniform Semi-Unificationrm semi-unification. We give an abstract criterion of the strategy on which a general rule-based calculus for symbolic semi-unification terminates. Based on this, we give an alternative and robust correctness proof of a rule-based uniform semi-unification algorithm.作者: blister 時(shí)間: 2025-3-25 05:52
A Graph Polynomial Approach to Primitivity the use of the subgraph component polynomial to count the number of primitive partial words of a given length over an alphabet of a fixed size, which leads to a method for enumerating such partial words.作者: 征稅 時(shí)間: 2025-3-25 11:04 作者: 有偏見 時(shí)間: 2025-3-25 14:43
Visibly Pushdown Automata: Universality and Inclusion via Antichainsit determinization and save computations. The approach is extended to hedge automata. We implement the proposed algorithms in a prototype tool and conduct experiments on randomly generated VPAs. We show that, on numerous instances, our algorithms outperform other VPA tools.作者: 肥料 時(shí)間: 2025-3-25 16:22 作者: 污穢 時(shí)間: 2025-3-25 23:21 作者: 似少年 時(shí)間: 2025-3-26 00:46 作者: 不開心 時(shí)間: 2025-3-26 04:50 作者: Fibrillation 時(shí)間: 2025-3-26 09:37 作者: forecast 時(shí)間: 2025-3-26 15:34 作者: 彩色的蠟筆 時(shí)間: 2025-3-26 20:35 作者: 流浪 時(shí)間: 2025-3-26 22:11
978-3-642-37063-2Springer-Verlag Berlin Heidelberg 2013作者: exhibit 時(shí)間: 2025-3-27 02:34
Language and Automata Theory and Applications978-3-642-37064-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 吃掉 時(shí)間: 2025-3-27 09:13
Complexity Dichotomy for Counting Problemsfication program of counting complexity of locally specified problems. This classification program is advanced in three interrelated frameworks: Graph Homomorphisms, Counting CSP, and Holant Problems. In each formulation, complexity dichotomy theorems have been achieved which classify every problem 作者: 斜谷 時(shí)間: 2025-3-27 10:33 作者: 繁榮地區(qū) 時(shí)間: 2025-3-27 16:41 作者: Obstacle 時(shí)間: 2025-3-27 18:45
Discrete Linear Dynamical Systems, and there is a fixed rule governing how the system evolves. Dynamical systems originate in the development of Newtonian mechanics, and have widespread applications in many areas of science and engineering. Systems that evolve in a piecewise continuous manner (typically via differential equations) 作者: DOSE 時(shí)間: 2025-3-27 22:03 作者: 圖畫文字 時(shí)間: 2025-3-28 05:25
On the Complexity of Shortest Path Problems on Discounted Cost Graphstion problem for DCRAs corresponds to computing shortest paths in graphs with more general forms of discounting than the well-studied notion of future discounting. We present solutions to two classes of such shortest path problems: in presence of both past and future discounting, we show the decisio作者: Postmenopause 時(shí)間: 2025-3-28 09:03 作者: fledged 時(shí)間: 2025-3-28 12:39 作者: inquisitive 時(shí)間: 2025-3-28 16:48
On the Construction of a Family of Automata That Are Generically Non-minimalce the ideas of a sequential automaton, that are automata with sequential trees as breadth-first spanning subtrees. We introduce the concept of elementary equivalent states and explore combinatorial properties of non-minimal sequential automata. We then show that minimality is negligible among seque作者: reception 時(shí)間: 2025-3-28 21:11
Limited Non-determinism Hierarchy of Counter Automata theory and due to their practical applications in data analysis. One of the most significant differences between weighted and classical automata concerns determinization: while every classical automaton can be determinized, this is not the case for weighted automata. Still, obtaining an equivalent 作者: 上下倒置 時(shí)間: 2025-3-29 01:37 作者: 補(bǔ)充 時(shí)間: 2025-3-29 06:00 作者: Calculus 時(shí)間: 2025-3-29 09:01 作者: 譏笑 時(shí)間: 2025-3-29 14:04 作者: Conscientious 時(shí)間: 2025-3-29 15:36 作者: Legend 時(shí)間: 2025-3-29 20:09 作者: 打火石 時(shí)間: 2025-3-30 01:48 作者: 能量守恒 時(shí)間: 2025-3-30 04:06 作者: Constituent 時(shí)間: 2025-3-30 12:05
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressionsy considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions. More precisely, we extend partial derivation of regular expressions to two-sided partial derivation of hairpin expressions and we show how to作者: 事與愿違 時(shí)間: 2025-3-30 15:23
8樓作者: 女上癮 時(shí)間: 2025-3-30 19:53
8樓作者: CURL 時(shí)間: 2025-3-30 20:45
8樓作者: Complement 時(shí)間: 2025-3-31 04:24
8樓作者: DAMN 時(shí)間: 2025-3-31 08:19
9樓作者: 推測(cè) 時(shí)間: 2025-3-31 09:27
9樓作者: 被告 時(shí)間: 2025-3-31 14:09
9樓作者: Anthem 時(shí)間: 2025-3-31 18:05
9樓作者: Negotiate 時(shí)間: 2025-3-31 23:11
10樓作者: Anthropoid 時(shí)間: 2025-4-1 03:41
10樓作者: Hectic 時(shí)間: 2025-4-1 06:03
10樓作者: 物質(zhì) 時(shí)間: 2025-4-1 10:54
10樓
