標(biāo)題: Titlebook: Descriptional Complexity of Formal Systems; 16th International W Helmut Jürgensen,Juhani Karhum?ki,Alexander Okhoti Conference proceedings [打印本頁] 作者: HAG 時(shí)間: 2025-3-21 16:57
書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)
書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)學(xué)科排名
書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開度
書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Descriptional Complexity of Formal Systems被引頻次
書目名稱Descriptional Complexity of Formal Systems被引頻次學(xué)科排名
書目名稱Descriptional Complexity of Formal Systems年度引用
書目名稱Descriptional Complexity of Formal Systems年度引用學(xué)科排名
書目名稱Descriptional Complexity of Formal Systems讀者反饋
書目名稱Descriptional Complexity of Formal Systems讀者反饋學(xué)科排名
作者: adequate-intake 時(shí)間: 2025-3-21 22:46 作者: Physiatrist 時(shí)間: 2025-3-22 00:26 作者: Trigger-Point 時(shí)間: 2025-3-22 04:46
Conference proceedings 2014bility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; complexity aspects of combinatorics on words; Kolmogorov complexity.作者: 天真 時(shí)間: 2025-3-22 10:45
https://doi.org/10.1007/978-94-007-6076-9lated on promise problems. On the other hand, we show that the tight quadratic gap between Las Vegas realtime probabilistic automata and realtime deterministic automata given for language recognition can be replaced with a tight exponential gap on promise problems. Lastly, we show how the situation 作者: 監(jiān)禁 時(shí)間: 2025-3-22 16:48
https://doi.org/10.1007/978-94-007-6076-9c context free, we give an example of a deterministic context-free language the left .-boundary set of which is already non context free. In fact, the finiteness problem for .-boundary sets of context-free languages becomes undecidable.作者: 監(jiān)禁 時(shí)間: 2025-3-22 18:45 作者: NATAL 時(shí)間: 2025-3-22 22:35
Automata with Reversal-Bounded Counters: A Survey,guages accepted by these machines as well as the decidability/undecidability of decision problems concerning these devices. We also give applications to several problems in automata theory and formal languages.作者: 極大的痛苦 時(shí)間: 2025-3-23 04:44
,Quantum Hashing via ,-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas,e construction is based on composition of a classical .-universal hash family and a given family of functions – quantum hash generators..In particular, using the relationship between .-universal hash families and Freivalds’ fingerprinting schemas we present explicit quantum hash function and prove t作者: innovation 時(shí)間: 2025-3-23 05:50 作者: Vulnerary 時(shí)間: 2025-3-23 12:28
Complexity of Extended vs. Classic , Parsers,classic method by Knuth [7] for . grammars, and the recent one by the authors [2], which directly builds the parser from . grammars represented as transition networks. For the . grammars, the classic Knuth’s method is indirect as it needs to convert them to .. We describe two parametric families of 作者: Aerophagia 時(shí)間: 2025-3-23 17:46 作者: effrontery 時(shí)間: 2025-3-23 18:19
State Complexity of Inversion Operations,e 2. (respectively, .). We consider the inversion operation where some substring of the given string is reversed. Formally, the inversion of a language . consists of all strings ... such that .?∈?.. We show that the nondeterministic state complexity of inversion is in Θ(..). We establish that the de作者: legitimate 時(shí)間: 2025-3-24 01:09
Cycles and Global Attractors of Reaction Systems,. In this work we continue a recent investigation of the complexity of detecting some interesting dynamical behaviours in reaction system. We prove that detecting global behaviours such as the presence of global attractors is . - complete. Deciding the presence of cycles in the dynamics and many oth作者: septicemia 時(shí)間: 2025-3-24 03:39 作者: 奇怪 時(shí)間: 2025-3-24 08:00 作者: 詞匯表 時(shí)間: 2025-3-24 12:41
Computation Width and Deviation Number,ation tree of . on a given input. The deviation number of . on a given input counts the number of nondeterministic paths that branch out from the best accepting computation. Deviation number is a best-case nondeterminism measure closely related to the guessing measure of Goldstine, Kintala and Wotsc作者: Anterior 時(shí)間: 2025-3-24 16:04
Boundary Sets of Regular and Context-Free Languages,-boundary set of a language?. are those words that belong to?., where the .-predecessor or the .-successor of these words w.r.t. the prefix (suffix, respectively) relation is not in?.. For regular languages described by deterministic finite automata (DFAs) we give tight bounds on the number of state作者: 意外的成功 時(shí)間: 2025-3-24 19:59
Biclique Coverings, Rectifier Networks and the Cost of ,-Removal,.)?≥?.(.).. As a corollary, we establish that there exist nondeterministic finite automata (NFAs) with .-transitions, having . transitions total such that the smallest equivalent .-free NFA has Ω(..) transitions. We also formulate a version of previous bounds for the weighted set cover problem and d作者: bourgeois 時(shí)間: 2025-3-25 00:44 作者: transplantation 時(shí)間: 2025-3-25 05:47 作者: ILEUM 時(shí)間: 2025-3-25 08:18
Prefix-Free Languages: Right Quotient and Reversal,tate complexity of right quotient and reversal, respectively. To prove the tightness of the bound for reversal, we use a ternary alphabet. Moreover, we prove that this bound cannot be met by any binary language. In the binary case, we get a lower bound 2.???7 infinitely often. Our calculations show 作者: 刀鋒 時(shí)間: 2025-3-25 12:38 作者: 微枝末節(jié) 時(shí)間: 2025-3-25 18:20 作者: arterioles 時(shí)間: 2025-3-25 20:18 作者: CYN 時(shí)間: 2025-3-26 04:03
https://doi.org/10.1007/978-94-007-6076-9ces of the pattern . in the tree .. For an input tree pattern . in linear prefix notation .(.)?=?...... …..., .?≥?1, the searching is performed in time ., where .(..) is the set of all occurrences of .. in .(.).作者: 沒血色 時(shí)間: 2025-3-26 07:59
Matter and Anti-Matter in Membrane Systems,ms are obtained in the accepting case. Universal P systems with a rather small number of rules – 57 for computing systems, 59 for generating and 53 for accepting systems – can be constructed when using non-cooperative rules together with matter/anti-matter annihilation rules having weak priority.作者: 柳樹；枯黃 時(shí)間: 2025-3-26 12:20
Complexity of Extended vs. Classic , Parsers,r novel direct methods. Experimental measurements of the number of parser states and of the parsing speed for two real languages (. and .) confirm the advantage of the new direct parser model for . grammars.作者: SEVER 時(shí)間: 2025-3-26 14:22 作者: IDEAS 時(shí)間: 2025-3-26 19:54 作者: Hypomania 時(shí)間: 2025-3-26 22:42 作者: Perceive 時(shí)間: 2025-3-27 01:50 作者: 尖叫 時(shí)間: 2025-3-27 06:52 作者: Melanocytes 時(shí)間: 2025-3-27 10:07
0302-9743 , held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs betw作者: CRAFT 時(shí)間: 2025-3-27 14:36 作者: 精美食品 時(shí)間: 2025-3-27 19:25
https://doi.org/10.1007/978-94-007-6076-9at detecting global behaviours such as the presence of global attractors is . - complete. Deciding the presence of cycles in the dynamics and many other related problems are also . - complete. Deciding bijectivity is, on the other hand, a . - complete problem.作者: Fierce 時(shí)間: 2025-3-28 01:16 作者: 表示問 時(shí)間: 2025-3-28 04:29 作者: institute 時(shí)間: 2025-3-28 10:15 作者: 罐里有戒指 時(shí)間: 2025-3-28 12:35
Cycles and Global Attractors of Reaction Systems,at detecting global behaviours such as the presence of global attractors is . - complete. Deciding the presence of cycles in the dynamics and many other related problems are also . - complete. Deciding bijectivity is, on the other hand, a . - complete problem.作者: Anemia 時(shí)間: 2025-3-28 16:21
Computation Width and Deviation Number, accepting computation. Deviation number is a best-case nondeterminism measure closely related to the guessing measure of Goldstine, Kintala and Wotschke (Infrom. Comput. 86, 1990, 179–194). We consider the descriptional complexity of NFAs with similar given deviation number and with computation width.作者: 入會(huì) 時(shí)間: 2025-3-28 22:14 作者: Immunization 時(shí)間: 2025-3-28 23:41
https://doi.org/10.1007/978-94-007-6049-3, the size of the syntactic semigroup, the state complexities of reversal, star, product, and all binary boolean operations that depend on both arguments. Thus (.) is a universal witness reaching the upper bounds for these measures.作者: modifier 時(shí)間: 2025-3-29 03:51 作者: Dislocation 時(shí)間: 2025-3-29 08:56 作者: 規(guī)章 時(shí)間: 2025-3-29 13:19
https://doi.org/10.1007/978-94-007-6049-3guages accepted by these machines as well as the decidability/undecidability of decision problems concerning these devices. We also give applications to several problems in automata theory and formal languages.作者: DOSE 時(shí)間: 2025-3-29 16:38 作者: nonplus 時(shí)間: 2025-3-29 20:37 作者: Accomplish 時(shí)間: 2025-3-30 00:12 作者: Introvert 時(shí)間: 2025-3-30 04:40 作者: Neolithic 時(shí)間: 2025-3-30 08:54 作者: Felicitous 時(shí)間: 2025-3-30 15:01 作者: Spartan 時(shí)間: 2025-3-30 20:17 作者: 鞠躬 時(shí)間: 2025-3-30 21:54
https://doi.org/10.1007/978-94-007-6049-3We survey several recent developments in quantum algorithms and complexity: 作者: 相一致 時(shí)間: 2025-3-31 02:09
https://doi.org/10.1007/978-94-007-6049-3A celebrated result of Schützenberger says that a language is star-free if and only if it is is recognized by a finite aperiodic monoid. We give a new proof for this theorem using local divisors.作者: vitrectomy 時(shí)間: 2025-3-31 08:47 作者: 陳腐的人 時(shí)間: 2025-3-31 10:10
https://doi.org/10.1007/978-94-007-6049-3In the paper we investigate a model for computing of Boolean functions – Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. 作者: 大方一點(diǎn) 時(shí)間: 2025-3-31 13:37 作者: Blemish 時(shí)間: 2025-3-31 20:39 作者: 外星人 時(shí)間: 2025-3-31 23:05 作者: fiscal 時(shí)間: 2025-4-1 04:21 作者: 露天歷史劇 時(shí)間: 2025-4-1 07:33
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/268289.jpg作者: 蕁麻 時(shí)間: 2025-4-1 13:05 作者: leniency 時(shí)間: 2025-4-1 15:11
https://doi.org/10.1007/978-94-007-6049-3e construction is based on composition of a classical .-universal hash family and a given family of functions – quantum hash generators..In particular, using the relationship between .-universal hash families and Freivalds’ fingerprinting schemas we present explicit quantum hash function and prove t作者: theta-waves 時(shí)間: 2025-4-1 21:21
https://doi.org/10.1007/978-94-007-6049-3 i.e., of (distributed) multiset rewriting systems applying rules in the maximally parallel way. Computational completeness can be obtained with using only non-cooperative rules besides these matter/anti-matter annihilation rules if these annihilation rules have priority over the other rules. Withou
