標題: Titlebook: Algebraic Informatics; Second International Symeon Bozapalidis,George Rahonis Conference proceedings 2007 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: Grant 時間: 2025-3-21 19:57
書目名稱Algebraic Informatics影響因子(影響力)
書目名稱Algebraic Informatics影響因子(影響力)學科排名
書目名稱Algebraic Informatics網(wǎng)絡公開度
書目名稱Algebraic Informatics網(wǎng)絡公開度學科排名
書目名稱Algebraic Informatics被引頻次
書目名稱Algebraic Informatics被引頻次學科排名
書目名稱Algebraic Informatics年度引用
書目名稱Algebraic Informatics年度引用學科排名
書目名稱Algebraic Informatics讀者反饋
書目名稱Algebraic Informatics讀者反饋學科排名
作者: 山崩 時間: 2025-3-21 20:14 作者: 虛度 時間: 2025-3-22 01:49
From Tree-Based Generators to Delegation Networks and picture generation. In the second part, an extension of the tree-based generator called delegation network is proposed. Intuitively, a delegation network is a network of tree-based generators that can “delegate” subtasks to each other. In this way, different types of tree-based generators can b作者: FEAT 時間: 2025-3-22 06:26
Bifinite Chu Spacesu spaces (.), the extensional Chu spaces (.), and the biextensional Chu spaces (.). The main results are .Unanticipated results driving this development include the fact that: .Chu spaces are a general framework for studying the dualities of objects and properties; points and open sets; terms and ty作者: BLA 時間: 2025-3-22 08:42
Tiling Recognizable Two-Dimensional Languagesrtheless two-dimensional recognizable languages are not closed under complement and this implies that are intrinsically non-deterministic. We introduce the notion of deterministic and unambiguous tiling system that generalizes deterministic and unambiguous automata for strings and show that, differe作者: EWER 時間: 2025-3-22 14:55
Algebraic Methods in Quantum Informatics, very useful, or even of the key importance..Some of these problems came up quite naturally, at a very straightforward quantumization of the classical informatics concepts, models and problems. However, the most attractive/important ones come up when one starts to dig deeper into the quantum world,作者: Microgram 時間: 2025-3-22 17:14
From Algebraic Graph Transformation to Adhesive HLR Categories and Systemslism, concurrency, embedding, critical pairs and confluence are introduced. As a generalization, the categorical framework of adhesive high-level replacement systems is introduced which allows to instantiate the rich theory to several interesting classes of high-level structures.作者: abnegate 時間: 2025-3-23 00:18 作者: Limousine 時間: 2025-3-23 03:16
Recognizable Picture Languages and Polyominoesthe problem posed by Matz of finding a non-recognizable picture language for which his technique for proving the non-recognizability of picture languages fails. We face the problem by studying the family of L-convex polyominoes and some closed families that are similar to the recognizable family of 作者: Bother 時間: 2025-3-23 07:04 作者: ESPY 時間: 2025-3-23 11:30
Learning Deterministically Recognizable Tree Series — Revisitednistic wta. The learning is exact, supervised, and uses an adapted minimal adequate teacher; a learning model introduced by Angluin. Our algorithm learns a minimal deterministic wta that recognizes the taught tree series and runs in polynomial time in the size of that wta and the size of the provide作者: Certainty 時間: 2025-3-23 16:13 作者: 食料 時間: 2025-3-23 22:05 作者: 哪有黃油 時間: 2025-3-24 02:03 作者: vector 時間: 2025-3-24 04:04
,5 Wondzorg bij pati?nten met decubitus,e to the connectivity threshold ... In particular, we examine the size of the second eigenvalue of the transition matrix corresponding to the Markov Chain that describes a random walk on an instance of the symmetric random intersection graph ... We show that with high probability the second eigenvalue is upper bounded by some constant .
作者: Dysarthria 時間: 2025-3-24 06:36
https://doi.org/10.1007/978-3-658-30928-2and a key agreement protocol for sensor networks, both from the SPINS protocol suite, with the OTS/CafeOBJ method, a well known formal specification technique applied not only in research, but also in industry. Based on this specification, we have proved that each protocol possesses an important safety(invariant) property.作者: CROW 時間: 2025-3-24 13:37 作者: instill 時間: 2025-3-24 15:41
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphse to the connectivity threshold ... In particular, we examine the size of the second eigenvalue of the transition matrix corresponding to the Markov Chain that describes a random walk on an instance of the symmetric random intersection graph ... We show that with high probability the second eigenvalue is upper bounded by some constant .
作者: Frequency-Range 時間: 2025-3-24 21:47 作者: Archipelago 時間: 2025-3-25 00:43 作者: 概觀 時間: 2025-3-25 04:04 作者: sperse 時間: 2025-3-25 09:55
Tiling Recognizable Two-Dimensional Languageseparated by means of examples and decidability properties. Finally we introduce a model of automaton, referred to as tiling automaton, defined as a scanning strategy plus a transition function given by a tiling system. Languages recognized by tiling automata are compared with ones recognized by on-line tesselation automata and four-way automata.作者: NAG 時間: 2025-3-25 15:22 作者: 品嘗你的人 時間: 2025-3-25 17:07
Encryption Steps: Transpositionhile other languages constructed using classical operations cannot be deterministically recognized. Furthermore we prove that there are unambiguously recognizable languages that cannot be deterministically recognized even in the case of one-letter alphabet. In particular .(DOTA)(1) is different from .(OTA)(1) (its non-deterministic counterpart).作者: 思想流動 時間: 2025-3-25 23:46 作者: 遺傳 時間: 2025-3-26 00:15
C.W.J. Oomens,A. Stekelenburg,F. Heuled counterexamples. Compared to the original algorithm, we show how to handle non-final states in the learning process; this problem was posed as an open problem in [Drewes, Vogler: ., J. Autom. Lang. Combin. 2007].作者: 無意 時間: 2025-3-26 05:17
https://doi.org/10.1007/978-3-662-04024-9ze WFA further to Parametric WFA by allowing different interpretations of the computed real vectors. These vector-components can be chosen as grayscale or colour intensities or e.g. as 3D-coordinates. Applications will be provided including well-known fractal sets and 3D polynomial spline-patches with textures.作者: irreparable 時間: 2025-3-26 08:31
On Generalizations of Weighted Finite Automata and Graphics Applicationsze WFA further to Parametric WFA by allowing different interpretations of the computed real vectors. These vector-components can be chosen as grayscale or colour intensities or e.g. as 3D-coordinates. Applications will be provided including well-known fractal sets and 3D polynomial spline-patches with textures.作者: 冥想后 時間: 2025-3-26 15:14
Algebraic Methods in Quantum Informatics into its phenomena, processes, laws and limitations. Among them are problems that belong to grand challenges not only of informatics (and physics), but of all current science. To get involved in exploration of such challenges is therefore much desirable for informatics community with algebraic expertise.作者: groggy 時間: 2025-3-26 16:53 作者: Visual-Field 時間: 2025-3-26 23:48
Recognizable Picture Languages and Polyominoesall polyominoes but result to be non-recognizable. Furthermore we prove that the family of L-convex polyominoes satisfies the necessary condition given by Matz for the recognizability and we conjecture that the family of L-convex polyominoes is non-recognizable.作者: Pelago 時間: 2025-3-27 01:30 作者: 男生如果明白 時間: 2025-3-27 06:20
Polyalphabetic Case: Probable Wordsbroidal category. The work presented here provides a basis for a constructive analysis of Chu spaces and opens the door to a more systematic investigation of such an analysis in a variety of settings.作者: 脫離 時間: 2025-3-27 10:56 作者: prick-test 時間: 2025-3-27 15:15 作者: 蝕刻術(shù) 時間: 2025-3-27 21:34 作者: 碳水化合物 時間: 2025-3-28 00:56
Composition of Classes of MethodsWe list fourteen characterizations of central words. We give the characterizations of Sturmian and episturmian words by lexicographic ordering, we show how the Burrows-Wheeler transform behaves on Sturmian words. We mention results on balanced episturmian words. We give a description of the compact suffix automaton of central Sturmian words.作者: 過濾 時間: 2025-3-28 05:45 作者: 胡言亂語 時間: 2025-3-28 07:37
Encryption Steps: Linear Substitutionlism, concurrency, embedding, critical pairs and confluence are introduced. As a generalization, the categorical framework of adhesive high-level replacement systems is introduced which allows to instantiate the rich theory to several interesting classes of high-level structures.作者: 親愛 時間: 2025-3-28 11:13 作者: ENNUI 時間: 2025-3-28 17:53 作者: 熱情贊揚 時間: 2025-3-28 21:29 作者: Affirm 時間: 2025-3-29 01:52 作者: 拾落穗 時間: 2025-3-29 05:50
C.W.J. Oomens,A. Stekelenburg,F. HeuleIn this paper we prove that the set of directed Eulerian graphs is not recognizable. On the other hand, the set of directed graphs with an Eulerian underlying graph is shown to be recognizable. Furthermore, we compute the syntactic complexity of this language and we compare it with that of connected graphs.作者: 積云 時間: 2025-3-29 09:45
Ganze algebraische Zahlen (§ 173.)We derive a normal form for linear context-free tree grammars that involves only growing productions. Based on this normal form we then show that all linear context-free tree languages are recognized by restarting tree automata which utilize auxiliary symbols.作者: 職業(yè)拳擊手 時間: 2025-3-29 11:47 作者: 共棲 時間: 2025-3-29 19:34 作者: 擁護者 時間: 2025-3-29 21:21 作者: 鬧劇 時間: 2025-3-30 02:45 作者: 煩擾 時間: 2025-3-30 04:12 作者: Osteoporosis 時間: 2025-3-30 11:44
From Tree-Based Generators to Delegation Networks and picture generation. In the second part, an extension of the tree-based generator called delegation network is proposed. Intuitively, a delegation network is a network of tree-based generators that can “delegate” subtasks to each other. In this way, different types of tree-based generators can be combined to generate complex objects.作者: 違法事實 時間: 2025-3-30 15:50 作者: 無法取消 時間: 2025-3-30 17:14
An Algebra for Tree-Based Music Generationg from input which is either generated by a regular tree grammar or provided by the user via a digital keyboard, a sequence of tree transducers is applied to generate a tree over the operations provided by the music algebra. The evaluation of this tree yields the musical piece generated.作者: Bridle 時間: 2025-3-30 22:50 作者: LUCY 時間: 2025-3-31 02:47
978-3-540-75413-8Springer-Verlag Berlin Heidelberg 2007作者: 斷斷續(xù)續(xù) 時間: 2025-3-31 07:39
https://doi.org/10.1007/978-3-662-04024-9xel-components in a very natural way. In this well understood context already meaningful operations on images like zooming or self-similarity can be formally introduced. We will turn then to finite automata with states and transitions labeled by real numbers as weights. These Weighted Finite Automat作者: 無可非議 時間: 2025-3-31 10:49
Composition of Classes of MethodsWe list fourteen characterizations of central words. We give the characterizations of Sturmian and episturmian words by lexicographic ordering, we show how the Burrows-Wheeler transform behaves on Sturmian words. We mention results on balanced episturmian words. We give a description of the compact 作者: Pruritus 時間: 2025-3-31 15:41
Aims and Methods of Cryptography and picture generation. In the second part, an extension of the tree-based generator called delegation network is proposed. Intuitively, a delegation network is a network of tree-based generators that can “delegate” subtasks to each other. In this way, different types of tree-based generators can b作者: 悄悄移動 時間: 2025-3-31 21:07 作者: 心胸狹窄 時間: 2025-4-1 00:01
Composition of Classes of Methodsrtheless two-dimensional recognizable languages are not closed under complement and this implies that are intrinsically non-deterministic. We introduce the notion of deterministic and unambiguous tiling system that generalizes deterministic and unambiguous automata for strings and show that, differe作者: Culmination 時間: 2025-4-1 05:28
Encryption Steps: Simple Substitution, very useful, or even of the key importance..Some of these problems came up quite naturally, at a very straightforward quantumization of the classical informatics concepts, models and problems. However, the most attractive/important ones come up when one starts to dig deeper into the quantum world,作者: NOVA 時間: 2025-4-1 09:24
Encryption Steps: Linear Substitutionlism, concurrency, embedding, critical pairs and confluence are introduced. As a generalization, the categorical framework of adhesive high-level replacement systems is introduced which allows to instantiate the rich theory to several interesting classes of high-level structures.作者: 生來 時間: 2025-4-1 10:45 作者: Metamorphosis 時間: 2025-4-1 17:29
,5 Wondzorg bij pati?nten met decubitus,the problem posed by Matz of finding a non-recognizable picture language for which his technique for proving the non-recognizability of picture languages fails. We face the problem by studying the family of L-convex polyominoes and some closed families that are similar to the recognizable family of 作者: FLOUR 時間: 2025-4-1 22:13 作者: 煩人 時間: 2025-4-1 23:23 作者: Daily-Value 時間: 2025-4-2 04:23
