標(biāo)題: Titlebook: Descriptional Complexity of Formal Systems; 24th IFIP WG 1.02 In Yo-Sub Han,Gy?rgy Vaszil Conference proceedings 2022 IFIP International Fe [打印本頁] 作者: 筆記 時間: 2025-3-21 18:49
書目名稱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é)科排名
作者: WAG 時間: 2025-3-21 21:58
,Ranking Binary Unlabelled Necklaces in?Polynomial Time,gorithm is to compute the rank of any word with respect to the set of unlabelled necklaces by finding three other ranks: the rank over all necklaces, the rank over symmetric unlabelled necklaces, and the rank over necklaces with an enclosing labelling. The last two concepts are introduced in this paper.作者: 考得 時間: 2025-3-22 01:51 作者: 冥界三河 時間: 2025-3-22 05:16
https://doi.org/10.1007/978-94-007-5974-9ct product of a permutation and a permutation-reset automaton the number?. is always magic if?. and?. fulfill some property, i.e., cannot be obtained by the direct product of any automata of this kind. Moreover, our results can be seen as a generalization of previous results in?[.] for the intersection operation on automata.作者: irreducible 時間: 2025-3-22 11:19
,On the?Descriptional Complexity of?the?Direct Product of?Finite Automata,ct product of a permutation and a permutation-reset automaton the number?. is always magic if?. and?. fulfill some property, i.e., cannot be obtained by the direct product of any automata of this kind. Moreover, our results can be seen as a generalization of previous results in?[.] for the intersection operation on automata.作者: endocardium 時間: 2025-3-22 14:50 作者: endocardium 時間: 2025-3-22 19:56
Conference proceedings 2022ons. The book also contains 4 invited talks.?The conference focus to all aspects of descriptional complexity including Automata, grammars, languages, and other formal systems; various modes of operations and complexity measures..作者: Carcinogenesis 時間: 2025-3-22 23:54
0302-9743 7 submissions. The book also contains 4 invited talks.?The conference focus to all aspects of descriptional complexity including Automata, grammars, languages, and other formal systems; various modes of operations and complexity measures..978-3-031-13256-8978-3-031-13257-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 協(xié)定 時間: 2025-3-23 03:30
https://doi.org/10.1007/978-94-007-5974-9gorithm is to compute the rank of any word with respect to the set of unlabelled necklaces by finding three other ranks: the rank over all necklaces, the rank over symmetric unlabelled necklaces, and the rank over necklaces with an enclosing labelling. The last two concepts are introduced in this paper.作者: inclusive 時間: 2025-3-23 06:55 作者: Synovial-Fluid 時間: 2025-3-23 13:11 作者: Atrium 時間: 2025-3-23 17:17 作者: surmount 時間: 2025-3-23 19:16 作者: 刺激 時間: 2025-3-23 23:55 作者: 向宇宙 時間: 2025-3-24 02:53 作者: 確定方向 時間: 2025-3-24 08:16
,Clusters of?Repetition Roots Forming Prefix Chains,e sense that any sequence of cluster sizes satisfying the lower bounds can be realized. We also take the next step towards the bounds on arbitrary (only partially prefix-ordered) sets of roots by proving a lower bound on unbordered prefixes shared by two overlapping prefix chains of roots.作者: Conducive 時間: 2025-3-24 14:06 作者: 傻瓜 時間: 2025-3-24 18:15 作者: legislate 時間: 2025-3-24 19:06 作者: fastness 時間: 2025-3-25 01:44 作者: 魔鬼在游行 時間: 2025-3-25 04:46
,On the?Power of?Recursive Word-Functions Without Concatenation,ds allows to address words directly and not through some integer encoding (of exponential size). Considering alphabets with at least two symbols allows to relate simply and naturally to complexity theory. Indeed, the polynomial-time complexity class (as well as . and exponential time) corresponds to作者: 投射 時間: 2025-3-25 08:07 作者: 口訣法 時間: 2025-3-25 12:21
,Nearly ,-Universal Words - Investigating a?Part of?Simon’s Congruence, of scattered factors (also known as subwords or subsequences), which are parts of the word in the correct order but not necessarily consecutive, e.g., . is a scattered factor of . but . is not. Following the idea of scattered factor .-universality (also known as .-richness), we investigate nearly .作者: 熔巖 時間: 2025-3-25 19:19
State Complexity of Binary Coded Regular Languages,ton (DFA) . with .?states recognizing a language . over?., we consider the problem of how many states we need for an automaton . that decides membership in?., the binary coded version of?.. Namely, .?accepts binary inputs belonging to?. and rejects binary inputs belonging to?., where .?is the comple作者: allude 時間: 2025-3-25 23:42 作者: 威脅你 時間: 2025-3-26 03:11 作者: 存在主義 時間: 2025-3-26 05:57
,Operations on?Subregular Languages and?Nondeterministic State Complexity,combinational, finitely generated left ideal, group, star, comet, two-sided comet, ordered, and power-separating languages, and consider the operations of intersection, union, concatenation, power, Kleene star, reversal, and complementation. We get the exact complexity in all cases, except for compl作者: BLINK 時間: 2025-3-26 08:31 作者: 聽寫 時間: 2025-3-26 15:03 作者: urethritis 時間: 2025-3-26 18:28
Lazy Regular Sensing,uitively, 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, when the input letters composing the word are truth assignments to a finite set of .. We introduce the notion of ., where the signals are not sensed simulta作者: 描繪 時間: 2025-3-27 00:38 作者: Fulsome 時間: 2025-3-27 02:25
Yet Another Canonical Nondeterministic Automaton,omaton (DFA), the canonical residual finite state automaton (RFSA), and the átomaton of a language, then the átomaton can be seen as the dual automaton of the minimal DFA, but no such dual has been presented for the canonical RFSA so far. We fill this gap by introducing a new canonical automaton tha作者: burnish 時間: 2025-3-27 08:47 作者: 解脫 時間: 2025-3-27 10:57
https://doi.org/10.1007/978-3-031-13257-5artificial intelligence; automata; automata theory; automation; computational linguistics; computer syste作者: 加強防衛(wèi) 時間: 2025-3-27 15:00
978-3-031-13256-8IFIP International Federation for Information Processing 2022作者: LINES 時間: 2025-3-27 18:49 作者: gastritis 時間: 2025-3-28 00:05 作者: 強所 時間: 2025-3-28 05:55
https://doi.org/10.1007/978-94-007-5974-9ds allows to address words directly and not through some integer encoding (of exponential size). Considering alphabets with at least two symbols allows to relate simply and naturally to complexity theory. Indeed, the polynomial-time complexity class (as well as . and exponential time) corresponds to作者: 有害處 時間: 2025-3-28 07:56 作者: 客觀 時間: 2025-3-28 12:33
https://doi.org/10.1007/978-94-007-5974-9 of scattered factors (also known as subwords or subsequences), which are parts of the word in the correct order but not necessarily consecutive, e.g., . is a scattered factor of . but . is not. Following the idea of scattered factor .-universality (also known as .-richness), we investigate nearly .作者: installment 時間: 2025-3-28 16:06
https://doi.org/10.1007/978-94-007-5974-9ton (DFA) . with .?states recognizing a language . over?., we consider the problem of how many states we need for an automaton . that decides membership in?., the binary coded version of?.. Namely, .?accepts binary inputs belonging to?. and rejects binary inputs belonging to?., where .?is the comple作者: Ordnance 時間: 2025-3-28 21:54 作者: 分開如此和諧 時間: 2025-3-29 00:01 作者: Introvert 時間: 2025-3-29 06:15
https://doi.org/10.1007/978-94-007-5974-9combinational, finitely generated left ideal, group, star, comet, two-sided comet, ordered, and power-separating languages, and consider the operations of intersection, union, concatenation, power, Kleene star, reversal, and complementation. We get the exact complexity in all cases, except for compl作者: MONY 時間: 2025-3-29 07:38
https://doi.org/10.1007/978-94-007-5974-9, which is regular by definition. Given a string?. over an alphabet?., we present an efficient DFA construction that accepts all .-congruent strings with respect to .. We also present lower bounds for the state complexity of the Simon’s congruence closure. Finally, we design a polynomial-time algori作者: 規(guī)范要多 時間: 2025-3-29 14:07 作者: GRIEF 時間: 2025-3-29 17:49
https://doi.org/10.1007/978-94-007-6049-3uitively, 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, when the input letters composing the word are truth assignments to a finite set of .. We introduce the notion of ., where the signals are not sensed simulta作者: inconceivable 時間: 2025-3-29 21:13
https://doi.org/10.1007/978-94-007-6049-3l or a hole in the word. Together with a subset of the input alphabet that gives the symbols which may be substituted for the?., a partial word finite automaton (.) represents a regular language. However, this substitution implies a certain form of limited nondeterminism in the computations when the作者: transplantation 時間: 2025-3-30 03:35 作者: Contracture 時間: 2025-3-30 05:08
https://doi.org/10.1007/978-94-007-6049-3a characterisation of the union-free languages, by restricting the 1CFPAs not to have transitions by the empty word, or to be deterministic, the n-union-free and the deterministic union-free languages are defined. Union-complexity as a measure of descriptional complexity of regular languages was int作者: Ostrich 時間: 2025-3-30 11:56 作者: 細(xì)微差別 時間: 2025-3-30 13:33
Descriptional Complexity of Formal Systems978-3-031-13257-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 替代品 時間: 2025-3-30 17:23 作者: 慢跑鞋 時間: 2025-3-31 00:16
https://doi.org/10.1007/978-94-007-5974-9raic (.) languages are decidable. It is also possible to check arithmetical constrains like . with . polynomial with positive coefficients in two (or more) variables. Every regular language is decidable if recursion can be defined on multiple functions at once.作者: CANE 時間: 2025-3-31 03:14 作者: 貝雷帽 時間: 2025-3-31 05:04 作者: 哄騙 時間: 2025-3-31 09:15
https://doi.org/10.1007/978-94-007-5974-9ing cases, the nondeterministic state complexity of all considered operations is the same as in the regular case, although sometimes we need to use a larger alphabet to describe the corresponding witnesses.
