標(biāo)題: Titlebook: Machines, Languages, and Complexity; 5th International Me J. Dassow,J. Kelemen Conference proceedings 1989 Springer-Verlag Berlin Heidelber [打印本頁] 作者: 斷頭臺(tái) 時(shí)間: 2025-3-21 19:52
書目名稱Machines, Languages, and Complexity影響因子(影響力)
書目名稱Machines, Languages, and Complexity影響因子(影響力)學(xué)科排名
書目名稱Machines, Languages, and Complexity網(wǎng)絡(luò)公開度
書目名稱Machines, Languages, and Complexity網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Machines, Languages, and Complexity被引頻次
書目名稱Machines, Languages, and Complexity被引頻次學(xué)科排名
書目名稱Machines, Languages, and Complexity年度引用
書目名稱Machines, Languages, and Complexity年度引用學(xué)科排名
書目名稱Machines, Languages, and Complexity讀者反饋
書目名稱Machines, Languages, and Complexity讀者反饋學(xué)科排名
作者: 腐蝕 時(shí)間: 2025-3-22 00:04 作者: etiquette 時(shí)間: 2025-3-22 00:55
Bernd Reichelimmer ein Bezug zu realen Anwendungen hergestellt. Eine klare optische Struktur der Inhalte erm?glicht es den Leserinnen und Leser zudem, den Kerntextvon weiterführenden Bemerkungen leicht zu unterscheiden.Dieser Band wird durch einen Aufgaben- und L?sungsbuch erg?nzt..978-3-662-55600-9作者: Apoptosis 時(shí)間: 2025-3-22 07:51 作者: 解脫 時(shí)間: 2025-3-22 09:36 作者: 后退 時(shí)間: 2025-3-22 16:10 作者: 紀(jì)念 時(shí)間: 2025-3-22 19:23 作者: LURE 時(shí)間: 2025-3-22 22:05
Arto Salomaa eine reiche Auswahl von leicht l?sbaren übungsaufgaben und schlie?lich tiefergehende "Projekte". Alles in allem über 300 übungsaufgaben - mit Tipps zu ihrer L?sung. Das Buch liegt nun in einer verbesserten und neu gesetzten Neuauflage vor.978-3-658-02412-3978-3-658-02413-0作者: 混合物 時(shí)間: 2025-3-23 01:36 作者: 桶去微染 時(shí)間: 2025-3-23 07:46
Postorder hierarchy for path compressions and set union,作者: 賞心悅目 時(shí)間: 2025-3-23 10:33
The convex hull problem on grids computational and combinatorial aspects,作者: LAIR 時(shí)間: 2025-3-23 16:33
Algorithmic learning from incomplete information: Principles and problems,作者: arthroplasty 時(shí)間: 2025-3-23 20:53 作者: 膝蓋 時(shí)間: 2025-3-24 02:12
Klaus-J?rn Langerk für Fortgeschrittene geeignet.. Mit dieser überarbeiteten Neuauflage stehen nun auch 180 auf das Buch abgestimmte Fragen und Antworten in der Springer-Nature-Flashcards-App zur Verfügung – so k?nnen Sie Ihre978-3-662-67173-3978-3-662-67174-0作者: Insul島 時(shí)間: 2025-3-24 04:12 作者: helper-T-cells 時(shí)間: 2025-3-24 07:22 作者: Retrieval 時(shí)間: 2025-3-24 11:57
Galina Jiráskovánschaften üblicherweise behandelt werden: Ausgehend von einem Kompaktkurs über algebraische Strukturen wie Gruppen, Ringe, K?rper und Vektorr?ume erfolgt der Einstieg in die Lineare Algebra anhand der Matrizentheorie. Im weiteren Verlauf werden Homomorphismen, Endomorphismen und Bilinearformen, dere作者: Protein 時(shí)間: 2025-3-24 18:45 作者: 鞭打 時(shí)間: 2025-3-24 19:07 作者: altruism 時(shí)間: 2025-3-24 23:50
Bernd Reichelh erg?nzt.Richtet sich an Mathematiker und Nichtmathematiker.Die erste Auflage hat als umfassendes Lehr-, Lern- und Referenzbuch der Linearen Algebra viel positive Resonanz hervorgerufen. In dieser zweiten Auflage wurde der Inhalt überarbeitet und erweitert. Ziel des Buchs ist es, die Theorie und An作者: barium-study 時(shí)間: 2025-3-25 04:11
Jarkko Karincludes supplementary material: Dieses Lehrbuch ist leicht verst?ndlich, speziell für Anf?nger der Mathematik sowohl im Bachelor- als auch im Lehramtsstudium.?Unter den vielen Büchern über Lineare Algebra, die Sie in der Bibliothek oder einer Buchhandlung finden, eignet dieses sich besonders dafür, 作者: 摘要 時(shí)間: 2025-3-25 10:15 作者: 不開心 時(shí)間: 2025-3-25 14:27
Questions of decidability for context-free chain code picture languages,om the current point" for letter u (d,r,l, resp.) and "lift (sink) the pen" for ↑ (↓). The set of unit lines traversed with sunk pen is the picture described. A set of pictures given by a set of picture descriptions generated by a context-free grammar is called a context-free (chain code) picture la作者: 馬籠頭 時(shí)間: 2025-3-25 17:55
Chomsky hierarchy and communication complexity,ls of both hierarchies. There are hard languages according to Chomsky hierarchy that belong to the lowest level in communication complexity hierarchy. On the other hand there is a deterministic linear language that requires the highest (linear) communication complexity. This is the main result becau作者: DOLT 時(shí)間: 2025-3-25 23:17 作者: Countermand 時(shí)間: 2025-3-26 02:03 作者: 有助于 時(shí)間: 2025-3-26 06:08
A partially persistent data structure for the set-union problem with backtracking, are possible. A partially persistent data structure is presented which maintains a partitions of an . set and performs each ., each . and each search in the past in . time per operation, at the same time allowing to backtrack, over the sequence of . in costant time. The space complexity of such a s作者: allude 時(shí)間: 2025-3-26 08:32
A note on the computational complexity of bracketing and related problems,complete problem. This problem is related to problems on random walks, planar triangulations of convex polygons and to the problem of comparison of two (labeled) rooted trees. The latter problem is studied with the connection to cluster analysis. Finally, some polynomially solvable classes of bracke作者: Latency 時(shí)間: 2025-3-26 16:16 作者: 失望未來 時(shí)間: 2025-3-26 20:22 作者: STERN 時(shí)間: 2025-3-27 00:25
Machines, Languages, and Complexity978-3-540-48203-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Factual 時(shí)間: 2025-3-27 03:44 作者: Hyperlipidemia 時(shí)間: 2025-3-27 09:11
A remark on some classifications of Indian parallel languages,We discuss the descriptional complexity measures number of nonterminals, number of productions, and number of symbols of Indian parallel grammars and Indian parallel languages.作者: 考得 時(shí)間: 2025-3-27 13:18
A survey of two-dimensional automata theory,The main purpose of this paper is to survey several properties of alternating, nondeterministic, and deterministic two-dimensional Turing machines (including two-dimensional finite automata and marker automata), and to briefly survey cellular types of two-dimensional automata.作者: 小步舞 時(shí)間: 2025-3-27 14:11
The virtual floating grid file,In this paper, an extension of the grid-file structure is introduced which makes it possible to substantially decrease the number of disk accesses performed during the resolution of range or partial-match queries. An analysis of such decrease is presented for both the general and a particular case.作者: chemoprevention 時(shí)間: 2025-3-27 19:27
The riches of rectangles,In this paper we consider some of the rectangle problems that have been studied in the literature of computational geometry. Our aim is to demonstrate that although rectangles are, perhaps, the simplest of geometrical figures, they occur naturally in many situations and, thus they are a rich source for intriguing and challenging problems.作者: aquatic 時(shí)間: 2025-3-28 01:27 作者: 郊外 時(shí)間: 2025-3-28 04:34
https://doi.org/10.1007/BFb0015922Algorithms; Automat; algorithm; artificial intelligence; automata; automata theory; complexity; computation作者: 未完成 時(shí)間: 2025-3-28 08:05
The simulation of two-dimensional one-marker automata by three-way turing machines,(nondeterministic) Turing machine by "TR2-DTM" ("TR2-NTM"). In this paper, we show that the necessary and sufficient space for TR2-NTM‘s to simulate 2-DM.‘s (2-NM.‘s) is .log. (..), and the necessary and sufficient space for TR2-DTM‘s to simulate 2-DM.‘s (2-NM.‘s) is 2. (2.(n.)), where . is the number of columns of rectangular input tapes.作者: STAT 時(shí)間: 2025-3-28 14:07
A partially persistent data structure for the set-union problem with backtracking, are possible. A partially persistent data structure is presented which maintains a partitions of an . set and performs each ., each . and each search in the past in . time per operation, at the same time allowing to backtrack, over the sequence of . in costant time. The space complexity of such a structure is ..作者: 文件夾 時(shí)間: 2025-3-28 16:04
A note on the computational complexity of bracketing and related problems,complete problem. This problem is related to problems on random walks, planar triangulations of convex polygons and to the problem of comparison of two (labeled) rooted trees. The latter problem is studied with the connection to cluster analysis. Finally, some polynomially solvable classes of bracketing problems are obtained.作者: 不法行為 時(shí)間: 2025-3-28 19:20 作者: 可忽略 時(shí)間: 2025-3-28 23:53 作者: Mri485 時(shí)間: 2025-3-29 03:58 作者: intuition 時(shí)間: 2025-3-29 08:32
0302-9743 S ‘88) held at Smolenice Castle (Czechoslovakia), November 14-18, 1988. It is divided into five chapters which approach the three crucial notions of contemporary theoretical computer science - machines, languages, and complexity - from different perspectives. The first chapter contains contributions作者: interlude 時(shí)間: 2025-3-29 13:23 作者: Incisor 時(shí)間: 2025-3-29 19:02
Conference proceedings 1989d at Smolenice Castle (Czechoslovakia), November 14-18, 1988. It is divided into five chapters which approach the three crucial notions of contemporary theoretical computer science - machines, languages, and complexity - from different perspectives. The first chapter contains contributions dealing w作者: Creditee 時(shí)間: 2025-3-29 20:08
6樓作者: pineal-gland 時(shí)間: 2025-3-30 00:27
6樓作者: chastise 時(shí)間: 2025-3-30 04:47
6樓作者: anagen 時(shí)間: 2025-3-30 11:19
7樓作者: 含糊其辭 時(shí)間: 2025-3-30 16:15
7樓作者: 媽媽不開心 時(shí)間: 2025-3-30 17:21
7樓作者: 無法破譯 時(shí)間: 2025-3-30 23:07
7樓作者: insipid 時(shí)間: 2025-3-31 04:10
8樓作者: Debility 時(shí)間: 2025-3-31 09:04
8樓作者: A簡潔的 時(shí)間: 2025-3-31 11:18
8樓作者: probate 時(shí)間: 2025-3-31 15:29
8樓作者: Demulcent 時(shí)間: 2025-3-31 21:05
9樓作者: medium 時(shí)間: 2025-3-31 23:46
9樓作者: Nerve-Block 時(shí)間: 2025-4-1 02:07
9樓作者: entitle 時(shí)間: 2025-4-1 09:23
9樓作者: Meditate 時(shí)間: 2025-4-1 11:48
10樓作者: 很像弓] 時(shí)間: 2025-4-1 15:17
10樓作者: Iatrogenic 時(shí)間: 2025-4-1 20:10
10樓作者: Lasting 時(shí)間: 2025-4-2 02:21
10樓
