標題: Titlebook: Descriptional Complexity of Formal Systems; 19th IFIP WG 1.02 In Giovanni Pighizzini,Cezar Campeanu Conference proceedings 2017 IFIP Intern [打印本頁] 作者: obdurate 時間: 2025-3-21 18:39
書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)
書目名稱Descriptional Complexity of Formal Systems影響因子(影響力)學科排名
書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡公開度
書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡公開度學科排名
書目名稱Descriptional Complexity of Formal Systems被引頻次
書目名稱Descriptional Complexity of Formal Systems被引頻次學科排名
書目名稱Descriptional Complexity of Formal Systems年度引用
書目名稱Descriptional Complexity of Formal Systems年度引用學科排名
書目名稱Descriptional Complexity of Formal Systems讀者反饋
書目名稱Descriptional Complexity of Formal Systems讀者反饋學科排名
作者: 顯示 時間: 2025-3-21 20:20 作者: Femine 時間: 2025-3-22 03:29 作者: troponins 時間: 2025-3-22 06:11 作者: 粗糙濫制 時間: 2025-3-22 10:19
Most Complex Non-returning Regular Languagesfferent alphabets. We prove that the maximal syntactic semigroup of a non-returning language has . elements and requires at least . generators. We find the maximal state complexities of atoms of non-returning languages. Finally, we show that there exists a most complex non-returning language that me作者: hair-bulb 時間: 2025-3-22 14:06 作者: hair-bulb 時間: 2025-3-22 19:03
Sensing as a Complexity Measure We introduce and study a new complexity measure, based on the . required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and .-regula作者: 手工藝品 時間: 2025-3-22 22:55 作者: Leisureliness 時間: 2025-3-23 01:59
Descriptional Complexity and Operations – Two Non-classical Casesdefine . as the set of all integers . such that there are .?languages ., ., with .In this paper we study these sets for the operation union, catenation, star, complement, set-subtraction, and intersection and the measure number of accepting states (defined for regular languages) as well as for rever作者: febrile 時間: 2025-3-23 06:56 作者: Biomarker 時間: 2025-3-23 09:50 作者: 幸福愉悅感 時間: 2025-3-23 15:04 作者: 通情達理 時間: 2025-3-23 20:27
Most Complex Non-returning Regular Languagesom, Han and Jirásková derived upper bounds on the state complexity of boolean operations and Kleene star, and proved that these bounds are tight using two different binary witnesses. They derived upper bounds for concatenation and reversal using three different ternary witnesses. These five witnesse作者: disciplined 時間: 2025-3-23 23:26
Uncountable Realtime Probabilistic Classesithmic space is enough for realtime PTMs on unary languages. On binary case, we follow the same result for double logarithmic space, which is tight. When replacing the worktape with some limited memories, we can follow uncountable results on unary languages for two counters.作者: 比賽用背帶 時間: 2025-3-24 02:57 作者: 下級 時間: 2025-3-24 09:05
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearitynent contains some insertion-deletion rules. A rule is applied to a string in a component and the resultant string is moved to the target component specified in the rule. When resources are so limited (especially, when deletion is context-free) then GCID systems are not known to describe the class o作者: Homocystinuria 時間: 2025-3-24 13:52 作者: gnarled 時間: 2025-3-24 15:39
Self-attraction Removal from Oritatami Systemss a computational model of this phenomenon, which lets its transcript, a sequence of beads (abstract molecules) fold cotranscriptionally via interactions between beads according to its ruleset. In this paper, we study the problem of removing self-attractions, which lets a bead interact with another 作者: Prognosis 時間: 2025-3-24 21:56 作者: LUMEN 時間: 2025-3-25 00:01
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages possible algebras, and for each of them, we provide an answer to the question whether or not it can be generated by a suffix-, factor-, or subword-free language. In each case when an algebra can be generated by such a language, we show that this language may be taken to be regular, and we compute u作者: tympanometry 時間: 2025-3-25 04:09 作者: BOON 時間: 2025-3-25 11:21
Square on Deterministic, Alternating, and Boolean Finite Automatauch that ., we describe a binary language accepted by an .-state DFA with . final states meeting the upper bound . on the state complexity of its square. We show that in the case of ., the corresponding upper bound cannot be met. Using the DFA witness for square with . states where half of them are 作者: negotiable 時間: 2025-3-25 13:18 作者: transient-pain 時間: 2025-3-25 19:20
https://doi.org/10.1007/978-3-031-52026-6etail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and .-regular languages, as well as applications of the study in practice, especially in the monitoring and synthesis of reactive systems.作者: 愚笨 時間: 2025-3-25 20:42
Epiphany and/or Politics? Nietzscheee language. In each case when an algebra can be generated by such a language, we show that this language may be taken to be regular, and we compute upper bounds on the state complexities of all the generated languages. Finally, we find generators that maximize these complexities.作者: depreciate 時間: 2025-3-26 03:36
https://doi.org/10.1007/978-1-349-00172-9re. We show that in the case of ., the corresponding upper bound cannot be met. Using the DFA witness for square with . states where half of them are final, we get the tight upper bounds on the complexity of the square operation on alternating and Boolean automata.作者: 光滑 時間: 2025-3-26 08:07
Descriptional Complexity and Operations – Two Non-classical Casessal, union, catenation, and star and the measures number of nonterminals, productions, and symbols (defined for context-free languages)..Moreover, we discuss the change of these sets if one restricts to finite languages, unary languages, and finite unary languages.作者: 夾死提手勢 時間: 2025-3-26 11:29 作者: MAIZE 時間: 2025-3-26 13:29 作者: opalescence 時間: 2025-3-26 19:10 作者: 帶來的感覺 時間: 2025-3-26 21:40 作者: judiciousness 時間: 2025-3-27 02:06
0302-9743 putational models, such as turing machines, ?nite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity..978-3-319-60251-6978-3-319-60252-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: discord 時間: 2025-3-27 06:08 作者: 膽小鬼 時間: 2025-3-27 13:13
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languagesee language. In each case when an algebra can be generated by such a language, we show that this language may be taken to be regular, and we compute upper bounds on the state complexities of all the generated languages. Finally, we find generators that maximize these complexities.作者: Outshine 時間: 2025-3-27 15:35
Square on Deterministic, Alternating, and Boolean Finite Automatare. We show that in the case of ., the corresponding upper bound cannot be met. Using the DFA witness for square with . states where half of them are final, we get the tight upper bounds on the complexity of the square operation on alternating and Boolean automata.作者: Grievance 時間: 2025-3-27 21:42
Conference proceedings 2017Complexity is a ?eld in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, ?nite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity..作者: esoteric 時間: 2025-3-27 23:04 作者: 貧窮地活 時間: 2025-3-28 04:11
After ,: Female Adultery in Zolat deterministic tree adjoining grammars (those with degree of nondeterminism equal to 1), can generate non-context-free languages, in contrast to deterministic head grammars which can only generate languages containing a single word.作者: 偏離 時間: 2025-3-28 09:31
Theorizing the Novel of Wifely Adulterymates with an indirect use of the existence of Puiseux expansions at singularities. We study, asymptotically and on average, the alphabetic size, the size of the .-follow automaton and the ratio of these expressions to standard regular expressions.作者: Corral 時間: 2025-3-28 12:37
,Olive Schreiner’s Organic Art, of a simple . operation and show that the decision problem whether a given tree (along with the rank info of its nodes) is a Union-Find tree is .-complete, complementing our earlier similar result for the union-by-size strategy.作者: 咒語 時間: 2025-3-28 16:53 作者: Barrister 時間: 2025-3-28 22:15 作者: PLIC 時間: 2025-3-29 00:18 作者: 供過于求 時間: 2025-3-29 04:02
Avoiding Overlaps in Pictures bifix-free) string..We study the problem of generating all unbordered pictures of fixed size and present a construction of non-expandable non-overlapping sets of pictures together with some examples.作者: 哪有黃油 時間: 2025-3-29 10:00
https://doi.org/10.1007/978-3-319-48695-6onents, we can extend this to GCID systems with just one more component to describe, for instance, 2-. and with further addition of one more component, we can extend to GCID systems that describe the rational closure of ..作者: 憂傷 時間: 2025-3-29 14:44
Studies in European Culture and Historyistic finite automaton. In case of pushdown automata, the conversion of a nondeterministic to a one-time nondeterministic as well as the conversion of a one-time nondeterministic to a deterministic one turn out to be non-recursive, that is, the trade-offs in size cannot be bounded by any recursive function.作者: 消極詞匯 時間: 2025-3-29 16:50 作者: 的闡明 時間: 2025-3-29 21:32
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearityonents, we can extend this to GCID systems with just one more component to describe, for instance, 2-. and with further addition of one more component, we can extend to GCID systems that describe the rational closure of ..作者: Infect 時間: 2025-3-30 02:22 作者: 繁榮中國 時間: 2025-3-30 04:06 作者: 抱怨 時間: 2025-3-30 09:37 作者: lactic 時間: 2025-3-30 14:42
978-3-319-60251-6IFIP International Federation for Information Processing 2017作者: GUEER 時間: 2025-3-30 20:12 作者: Mhc-Molecule 時間: 2025-3-30 21:28
https://doi.org/10.1007/978-3-319-48695-6ithmic space is enough for realtime PTMs on unary languages. On binary case, we follow the same result for double logarithmic space, which is tight. When replacing the worktape with some limited memories, we can follow uncountable results on unary languages for two counters.作者: 清晰 時間: 2025-3-31 01:51
https://doi.org/10.1007/978-3-031-52026-6 We introduce and study a new complexity measure, based on the . required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and .-regula作者: commute 時間: 2025-3-31 05:49 作者: thwart 時間: 2025-3-31 10:39
https://doi.org/10.1007/978-3-031-52026-6define . as the set of all integers . such that there are .?languages ., ., with .In this paper we study these sets for the operation union, catenation, star, complement, set-subtraction, and intersection and the measure number of accepting states (defined for regular languages) as well as for rever作者: 槍支 時間: 2025-3-31 15:08
https://doi.org/10.1007/978-3-031-52026-6this work: input-altering, input-preserving, and input-decreasing. Two words are t-dependent, if one is the output of t when the other one is used as input. A t-independent language is one containing no two t-dependent words. Examples of independent languages are found in noiseless coding theory, no
