標(biāo)題: Titlebook: Descriptional Complexity of Formal Systems; 13 International Wor Markus Holzer,Martin Kutrib,Giovanni Pighizzini Conference proceedings 201 [打印本頁(yè)] 作者: 空格 時(shí)間: 2025-3-21 17:10
書(shū)目名稱Descriptional Complexity of Formal Systems影響因子(影響力)
書(shū)目名稱Descriptional Complexity of Formal Systems影響因子(影響力)學(xué)科排名
書(shū)目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Descriptional Complexity of Formal Systems被引頻次
書(shū)目名稱Descriptional Complexity of Formal Systems被引頻次學(xué)科排名
書(shū)目名稱Descriptional Complexity of Formal Systems年度引用
書(shū)目名稱Descriptional Complexity of Formal Systems年度引用學(xué)科排名
書(shū)目名稱Descriptional Complexity of Formal Systems讀者反饋
書(shū)目名稱Descriptional Complexity of Formal Systems讀者反饋學(xué)科排名
作者: 慢慢沖刷 時(shí)間: 2025-3-21 22:31
A Field Extension as a Vector SpaceGiven a formal language . specified in various ways, we consider the problem of determining if . is nonempty. If . is indeed nonempty, we find upper and lower bounds on the length of the shortest string in ..作者: 指令 時(shí)間: 2025-3-22 02:59
Finite Fields I: Basic PropertiesWe study the size-cost of boolean operations on .. We prove an . exponential blow-up for union and intersection, as well as polynomial blow-up for complement.作者: Cumulus 時(shí)間: 2025-3-22 08:36
Stephen Williams,Ayanna M. HowardThe . asks for the size of the smallest DFA needed to distinguish between two words of length ≤?. (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results.作者: CLIFF 時(shí)間: 2025-3-22 10:45
Decidability and Shortest Strings in Formal LanguagesGiven a formal language . specified in various ways, we consider the problem of determining if . is nonempty. If . is indeed nonempty, we find upper and lower bounds on the length of the shortest string in ..作者: 令人發(fā)膩 時(shí)間: 2025-3-22 13:44 作者: 令人發(fā)膩 時(shí)間: 2025-3-22 20:47
Remarks on Separating WordsThe . asks for the size of the smallest DFA needed to distinguish between two words of length ≤?. (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results.作者: 向宇宙 時(shí)間: 2025-3-22 22:26 作者: Abrupt 時(shí)間: 2025-3-23 01:43
978-3-642-22599-4Springer-Verlag GmbH Berlin Heidelberg 2011作者: Fantasy 時(shí)間: 2025-3-23 06:30
A Field Extension as a Vector Spaceood, the inverse automaton may need a much larger neighborhood. Our interest is to find good upper bounds for the size of this inverse neighborhood. It turns out that a linear algebra approach provides better bounds than any known combinatorial methods. We also consider cellular automata that are no作者: 常到 時(shí)間: 2025-3-23 10:46
Finite Fields II: Additional Propertieskers and a read/write window of fixed size. This paper begins with a short description of the general model of the restarting automaton and its major variants. In particular, the question for the influence of the size of the . on the expressive power of the various types of restarting automata is ad作者: liaison 時(shí)間: 2025-3-23 14:17 作者: 細(xì)菌等 時(shí)間: 2025-3-23 19:05 作者: 遺產(chǎn) 時(shí)間: 2025-3-24 01:35
Finite Fields II: Additional Propertiesoperate when forming a team in the process of generating terminal words. We present several results which strongly suggest that this measure is trivial in the sense that the degree of team cooperation of any language is bounded by a constant. Finally, we prove that the degree of team cooperation of 作者: 媽媽不開(kāi)心 時(shí)間: 2025-3-24 03:15 作者: FLEET 時(shí)間: 2025-3-24 08:42 作者: Ancestor 時(shí)間: 2025-3-24 14:38
Stephen Williams,Ayanna M. Howardminimal number of components necessary to generate all recursively enumerable languages. We present a construction which improves the currently known best bounds of seven (with three predefined clusters) and six (in the non-clustered case) to five, in both cases (having four clusters in the clustere作者: 寒冷 時(shí)間: 2025-3-24 18:16 作者: Cleave 時(shí)間: 2025-3-24 21:34 作者: tenosynovitis 時(shí)間: 2025-3-25 01:33 作者: 逃避系列單詞 時(shí)間: 2025-3-25 04:33 作者: 親密 時(shí)間: 2025-3-25 09:09
Springer Tracts in Advanced Roboticsle final state and are one-cycle-free-path, thus the witness languages are deterministic union-free. This result allows us to describe a binary language such that the nondeterministic state complexity of the language and of its complement is . and .?+?1, respectively, while the state complexity of t作者: absorbed 時(shí)間: 2025-3-25 12:09
Inkyu Sa,Stefan Hrabar,Peter Corkese necessary to represent the results of the following operations: (i) intersection of an .-state 2DFA and an .-state 2DFA requires between .?+?. and .?+?.?+?1 states; (ii) union of an .-state 2DFA and an .-state 2DFA, between .?+?. and 2.?+?.?+?4 states; (iii) Kleene star of an .-state 2DFA, (.(.)?作者: Modicum 時(shí)間: 2025-3-25 16:27 作者: Polydipsia 時(shí)間: 2025-3-26 00:01 作者: 進(jìn)取心 時(shí)間: 2025-3-26 01:37 作者: 表被動(dòng) 時(shí)間: 2025-3-26 05:08
Descriptional Complexity of Formal Systems978-3-642-22600-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 男生如果明白 時(shí)間: 2025-3-26 09:31
A Field Extension as a Vector Spacenets with read arcs, and which are more suitable to represent the case of concurrent read access. We discuss the problem of (efficiently) constructing unfoldings of such nets. On the basis of these unfoldings, various verification problems can be encoded as satisfiability problems in propositional logic.作者: 假裝是我 時(shí)間: 2025-3-26 12:57
Linear Algebra Based Bounds for One-Dimensional Cellular Automataood, the inverse automaton may need a much larger neighborhood. Our interest is to find good upper bounds for the size of this inverse neighborhood. It turns out that a linear algebra approach provides better bounds than any known combinatorial methods. We also consider cellular automata that are no作者: scrutiny 時(shí)間: 2025-3-26 18:23
On Restarting Automata with Window Size Onekers and a read/write window of fixed size. This paper begins with a short description of the general model of the restarting automaton and its major variants. In particular, the question for the influence of the size of the . on the expressive power of the various types of restarting automata is ad作者: VEST 時(shí)間: 2025-3-26 23:12 作者: ornithology 時(shí)間: 2025-3-27 01:56
The Power of Diversity of the languages being recognized. In this expository paper, we will first survey some basic ideas that have been useful in this model. In the second part, we sketch how this dual approach can be generalized to study some important class of boolean circuits, what results have been obtained, what qu作者: nostrum 時(shí)間: 2025-3-27 05:42 作者: SPER 時(shí)間: 2025-3-27 12:24 作者: Heretical 時(shí)間: 2025-3-27 15:02 作者: insecticide 時(shí)間: 2025-3-27 19:15
On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systemsminimal number of components necessary to generate all recursively enumerable languages. We present a construction which improves the currently known best bounds of seven (with three predefined clusters) and six (in the non-clustered case) to five, in both cases (having four clusters in the clustere作者: orthodox 時(shí)間: 2025-3-27 23:43
On Contextual Grammars with Subregular Selection Languagesconsider families . which are obtained by restriction to . states or nonterminals or productions or symbols to accept or to generate regular languages, we obtain four infinite hierarchies of the corresponding families of languages generated by external contextual grammars with selection languages in作者: obnoxious 時(shí)間: 2025-3-28 03:51
-Local Internal Contextual Grammarsl grammars. These grammars are, in fact, classical internal contextual grammars, but their only permitted derivations are those that can be described in a restricted manner (that depends on the number .). Using this formalism we define different classes of languages, and obtain a series of language 作者: 不適當(dāng) 時(shí)間: 2025-3-28 09:58 作者: 啤酒 時(shí)間: 2025-3-28 13:41 作者: 直覺(jué)沒(méi)有 時(shí)間: 2025-3-28 15:41 作者: Solace 時(shí)間: 2025-3-28 21:12
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabetse necessary to represent the results of the following operations: (i) intersection of an .-state 2DFA and an .-state 2DFA requires between .?+?. and .?+?.?+?1 states; (ii) union of an .-state 2DFA and an .-state 2DFA, between .?+?. and 2.?+?.?+?4 states; (iii) Kleene star of an .-state 2DFA, (.(.)?作者: AVID 時(shí)間: 2025-3-28 23:59 作者: LEVY 時(shí)間: 2025-3-29 05:07
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and ReversalIn this paper, we study the state complexities of union and intersection combined with star and reversal, respectively. We obtain the exact bounds for these combined operations on regular languages and show that, as usually, they are different from the mathematical compositions of the state complexities of their individual participating operations.作者: 輕率的你 時(shí)間: 2025-3-29 07:14
0302-9743 y; 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; Kolmogorov complexity.978-3-642-22599-4978-3-642-22600-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: deficiency 時(shí)間: 2025-3-29 14:37 作者: 產(chǎn)生 時(shí)間: 2025-3-29 18:39
A Field Extension as a Vector Spacelar automaton in question is not surjective. All our results deal with one-dimensional cellular automata. Undecidability results imply that in higher dimensional cases no computable upper bound exists for any of the considered quantities.作者: STEER 時(shí)間: 2025-3-29 20:41 作者: 增強(qiáng) 時(shí)間: 2025-3-30 02:02 作者: 音的強(qiáng)弱 時(shí)間: 2025-3-30 05:06
On Restarting Automata with Window Size Onearting automata in relation to the .(1)-automata on the one hand and the (deterministic and nondeterministic) finite-state acceptors on the other hand. Then various types of cooperating distributed systems (CD-systems) of deterministic .(1)-automata are presented. If all components of such a system 作者: 相一致 時(shí)間: 2025-3-30 12:00 作者: licence 時(shí)間: 2025-3-30 16:12
On the Degree of Team Cooperation in CD Grammar Systemsl in the sense that the degree of team cooperation of any language is bounded by a constant. Finally, we prove that the degree of team cooperation of a given cooperating/distributed grammar system cannot be algorithmically computed and discuss a decision problem.作者: 忘恩負(fù)義的人 時(shí)間: 2025-3-30 18:40 作者: 易彎曲 時(shí)間: 2025-3-30 22:28 作者: 粗糙濫制 時(shí)間: 2025-3-31 04:00 作者: 完成 時(shí)間: 2025-3-31 05:57 作者: SOB 時(shí)間: 2025-3-31 12:56
Kleene Theorems for Product Systems . with a restriction of ., that is, the initial global state is a feedback vertex set, going from systems to expressions is still polynomial time; in the reverse direction it is polynomial time with access to an NP oracle for finding deadlocks.作者: 光明正大 時(shí)間: 2025-3-31 17:16 作者: Protein 時(shí)間: 2025-3-31 17:52
Inkyu Sa,Stefan Hrabar,Peter Corke+?.(.)). states, where . is the maximum value of .(.., …, ..) for ., known as Landau’s function; (iv) .-th power of an .-state 2DFA, between (.???1).(.)???. and .(.(.)?+?.) states; (v) concatenation of an .-state and an .-state 2DFAs, . states.作者: 運(yùn)動(dòng)的我 時(shí)間: 2025-3-31 23:26
On Contextual Grammars with Subregular Selection Languages .. Moreover, we give some results on the power of external contextual grammars with regular commutative, regular circular, definite, suffix-free, ordered, combinational, nilpotent, and union-free selection languages.作者: 有惡意 時(shí)間: 2025-4-1 02:58
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet+?.(.)). states, where . is the maximum value of .(.., …, ..) for ., known as Landau’s function; (iv) .-th power of an .-state 2DFA, between (.???1).(.)???. and .(.(.)?+?.) states; (v) concatenation of an .-state and an .-state 2DFAs, . states.作者: 鞠躬 時(shí)間: 2025-4-1 06:29 作者: 審問(wèn) 時(shí)間: 2025-4-1 13:29
Finite Fields II: Additional Properties part, we sketch how this dual approach can be generalized to study some important class of boolean circuits, what results have been obtained, what questions are still open. The intuition gained in the simple model sometimes carry through, sometimes not, so that one has to be careful on what conjectures to make.
