標(biāo)題: Titlebook: Developments in Language Theory; 12th International C Masami Ito,Masafumi Toyama Conference proceedings 2008 Springer-Verlag Berlin Heidelb [打印本頁] 作者: DUCT 時(shí)間: 2025-3-21 19:29
書目名稱Developments in Language Theory影響因子(影響力)
書目名稱Developments in Language Theory影響因子(影響力)學(xué)科排名
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Developments in Language Theory被引頻次
書目名稱Developments in Language Theory被引頻次學(xué)科排名
書目名稱Developments in Language Theory年度引用
書目名稱Developments in Language Theory年度引用學(xué)科排名
書目名稱Developments in Language Theory讀者反饋
書目名稱Developments in Language Theory讀者反饋學(xué)科排名
作者: gerrymander 時(shí)間: 2025-3-21 23:36
Various Aspects of Finite Quantum Automataof Kurt G?del [18], Alan Turing [31], and Alonso Church [11], thus locating the appearance of computer science to 1930’s. Some want to mention Charles Babbage’s engines, some Gottfried Leibniz’ Calculus Ratiocinator, and some refer back to the Euclidean algorithm.作者: ILEUM 時(shí)間: 2025-3-22 01:12 作者: 性行為放縱者 時(shí)間: 2025-3-22 05:53
Selected Ideas Used for Decidability and Undecidability of Bisimilarityting in language theory, like context-free grammars and pushdown automata. In particular, it focuses on the method of finite bases of bisimulations in the case of decidability and the method of “Defender’s forcing” in the case of undecidability. An intent was to write an easy-to-read article in a sl作者: Debrief 時(shí)間: 2025-3-22 09:43
The Frobenius Problem and Its Generalizationsombination of the .. if and only if .. The . is the following: given positive integers .., .., ..., .. with ., compute the largest integer . representable as a non-negative integer linear combination of the ... This largest integer is sometimes denoted .(..,..., ..).作者: 陰謀小團(tuán)體 時(shí)間: 2025-3-22 14:21 作者: 陰謀小團(tuán)體 時(shí)間: 2025-3-22 19:23
On the Non-deterministic Communication Complexity of Regular Languagesleast logarithmic non-deterministic communication complexity. We prove several linear lower bounds which we know cover a wide range of regular languages with linear complexity. Furthermore we find evidence that previous techniques (Tesson and Thérien 2005) for proving linear lower bounds, for instan作者: Eviction 時(shí)間: 2025-3-22 23:00 作者: Recessive 時(shí)間: 2025-3-23 03:07 作者: bifurcate 時(shí)間: 2025-3-23 07:05
The Average State Complexity of the Star of a Finite Set of Words Is Linearual deterministic automata recognizing .., has on average . states and that the average state complexity of .. is .(.). We also show that the average time complexity of the computation of the automaton . is ., when the alphabet is of size at least three.作者: 燈絲 時(shí)間: 2025-3-23 10:55
On the Computational Capacity of Parallel Communicating Finite Automataour working modes. It is known that systems in the most general mode are as powerful as one-way multihead finite automata. Here we solve some open problems on the computational capacity of systems working in the remaining modes. In particular, it is shown that deterministic returning and non-returni作者: pericardium 時(shí)間: 2025-3-23 16:10 作者: 泥沼 時(shí)間: 2025-3-23 20:42 作者: Mystic 時(shí)間: 2025-3-23 22:51 作者: Infect 時(shí)間: 2025-3-24 05:15 作者: Fecal-Impaction 時(shí)間: 2025-3-24 07:02 作者: 破譯 時(shí)間: 2025-3-24 14:10 作者: 橫條 時(shí)間: 2025-3-24 15:03 作者: Concrete 時(shí)間: 2025-3-24 20:49
Conference proceedings 2008noes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory and logic; bio-inspired computing; quantum computing.作者: 不如樂死去 時(shí)間: 2025-3-25 02:13
0302-9743 a; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory and logic; bio-inspired computing; quantum computing.978-3-540-85779-2978-3-540-85780-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 聚集 時(shí)間: 2025-3-25 05:47
Us vs. Them: But Who Is , and Who Is ,? domain of a universal machine; still, the halting probability .. of such a set . is Martin-L?f random. Furthermore, it is investigated to which extend this results can be transferred to plain universal machines.作者: Recessive 時(shí)間: 2025-3-25 08:55
Universal Recursively Enumerable Sets of Strings domain of a universal machine; still, the halting probability .. of such a set . is Martin-L?f random. Furthermore, it is investigated to which extend this results can be transferred to plain universal machines.作者: AUGER 時(shí)間: 2025-3-25 12:15
0302-9743 oto, Japan, September 2008. The 36 revised full papers presented together with 6 invited papers were carefully reviewed and selected from 102 submissions. All important issues in language theory are addressed including grammars, acceptors and transducers for words, trees and graphs; algebraic theori作者: 主動脈 時(shí)間: 2025-3-25 19:05 作者: Graphite 時(shí)間: 2025-3-25 21:09 作者: 肥料 時(shí)間: 2025-3-26 02:10 作者: browbeat 時(shí)間: 2025-3-26 07:54
The Business of Business Is the Human Personne in time . the degree of polynomial ambiguity of a polynomially ambiguous automaton .. Finally, we present an application of our algorithms to an approximate computation of the entropy of a probabilistic automaton.作者: inundate 時(shí)間: 2025-3-26 09:33
Humanism in a Non-Humanist Worldy deterministic non-returning centralized systems. Furthermore, we show that nondeterministic centralized systems are strictly more powerful than their deterministic variants. Finally, incomparability with the class of (deterministic) (linear) context-free languages as well as the Church-Rosser languages is derived.作者: 中古 時(shí)間: 2025-3-26 14:34 作者: MAG 時(shí)間: 2025-3-26 20:07
On the Computational Capacity of Parallel Communicating Finite Automatay deterministic non-returning centralized systems. Furthermore, we show that nondeterministic centralized systems are strictly more powerful than their deterministic variants. Finally, incomparability with the class of (deterministic) (linear) context-free languages as well as the Church-Rosser languages is derived.作者: Common-Migraine 時(shí)間: 2025-3-26 21:31 作者: 怒目而視 時(shí)間: 2025-3-27 04:27 作者: BRAVE 時(shí)間: 2025-3-27 06:55
On the Non-deterministic Communication Complexity of Regular Languageses with linear complexity. Furthermore we find evidence that previous techniques (Tesson and Thérien 2005) for proving linear lower bounds, for instance in deterministic and probabilistic models, do not work in the non-deterministic setting.作者: Brittle 時(shí)間: 2025-3-27 12:27
https://doi.org/10.1007/978-94-017-9704-7 if the generated language is empty. The lower bound is established by simulating the behavior of an alternating Turing machine working in exponential space. We also compare multi-pushdown automata with the model of bounded-phase multi-stack (visibly) pushdown automata.作者: 牲畜欄 時(shí)間: 2025-3-27 16:56 作者: 青石板 時(shí)間: 2025-3-27 20:51
Humanistic Ethics in the Age of Globality variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the . step limited derivations (for .?≥?3) as underlying derivations, they are able to generate any recursively enumerable language.作者: Radiation 時(shí)間: 2025-3-27 21:59
Conference proceedings 2008, September 2008. The 36 revised full papers presented together with 6 invited papers were carefully reviewed and selected from 102 submissions. All important issues in language theory are addressed including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of auto作者: 鐵塔等 時(shí)間: 2025-3-28 03:44 作者: Monolithic 時(shí)間: 2025-3-28 07:41 作者: 無聊的人 時(shí)間: 2025-3-28 12:32 作者: adumbrate 時(shí)間: 2025-3-28 17:55 作者: jovial 時(shí)間: 2025-3-28 22:36 作者: Compass 時(shí)間: 2025-3-29 00:27
On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes language. We show here that even the best known methods for this purpose fail for some concrete regular languages..Finally, we give an overview of the results about the influence of the degree of ambiguity on the size of NFA’s and discuss the relation between the descriptional complexity of NFA’s a作者: 清楚 時(shí)間: 2025-3-29 05:50 作者: Dysplasia 時(shí)間: 2025-3-29 09:14 作者: 不能根除 時(shí)間: 2025-3-29 13:35 作者: confederacy 時(shí)間: 2025-3-29 18:02 作者: vitreous-humor 時(shí)間: 2025-3-29 21:57
Humanism and the Challenge of Differenceombination of the .. if and only if .. The . is the following: given positive integers .., .., ..., .. with ., compute the largest integer . representable as a non-negative integer linear combination of the ... This largest integer is sometimes denoted .(..,..., ..).作者: 笨重 時(shí)間: 2025-3-30 01:50
The Business of Business Is the Human Personual deterministic automata recognizing .., has on average . states and that the average state complexity of .. is .(.). We also show that the average time complexity of the computation of the automaton . is ., when the alphabet is of size at least three.作者: 外向者 時(shí)間: 2025-3-30 07:18 作者: 雕鏤 時(shí)間: 2025-3-30 10:26 作者: 原來 時(shí)間: 2025-3-30 12:22 作者: 污穢 時(shí)間: 2025-3-30 20:17 作者: Vasodilation 時(shí)間: 2025-3-30 21:56 作者: 用不完 時(shí)間: 2025-3-31 04:42 作者: 公司 時(shí)間: 2025-3-31 08:59
The Synchronization Problem for Strongly Transitive AutomataThe synchronization problem is investigated for a new class of deterministic automata called strongly transitive. An extension to unambiguous automata is also considered.作者: 生氣地 時(shí)間: 2025-3-31 11:18
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/270229.jpg作者: Communal 時(shí)間: 2025-3-31 15:26
Iteration Semiringsn semiring is a Conway semiring satisfying Conway’s group equations. In this extended abstract, we review the role of iteration semirings in the axiomatization of regular languages and rational power series, and in the axiomatization of the equational theory of continuous and complete semirings.作者: Lacunar-Stroke 時(shí)間: 2025-3-31 19:33 作者: CODA 時(shí)間: 2025-3-31 23:58
The Frobenius Problem and Its Generalizationsombination of the .. if and only if .. The . is the following: given positive integers .., .., ..., .. with ., compute the largest integer . representable as a non-negative integer linear combination of the ... This largest integer is sometimes denoted .(..,..., ..).作者: Cardiac-Output 時(shí)間: 2025-4-1 03:42
The Average State Complexity of the Star of a Finite Set of Words Is Linearual deterministic automata recognizing .., has on average . states and that the average state complexity of .. is .(.). We also show that the average time complexity of the computation of the automaton . is ., when the alphabet is of size at least three.作者: 臭了生氣 時(shí)間: 2025-4-1 06:14
On a Generalization of Standard Episturmian Morphisms paper, we introduce and study ., that is, morphisms which map standard episturmian words into standard .-episturmian words. They are a natural extension of standard episturmian morphisms. The main result of the paper is a characterization of these morphisms when they are injective.作者: 紅潤 時(shí)間: 2025-4-1 12:03 作者: 過于平凡 時(shí)間: 2025-4-1 14:19 作者: tattle 時(shí)間: 2025-4-1 18:32
https://doi.org/10.1007/978-3-030-67004-7n semiring is a Conway semiring satisfying Conway’s group equations. In this extended abstract, we review the role of iteration semirings in the axiomatization of regular languages and rational power series, and in the axiomatization of the equational theory of continuous and complete semirings.作者: 制定法律 時(shí)間: 2025-4-2 01:26 作者: 音樂戲劇 時(shí)間: 2025-4-2 05:25
When Skin and Technology Intertwineor a given NFA is PSPACE-complete. This fact motivates the following computational problems:.(i) Find a minimal NFA for a regular language ., if . is given by another suitable formal description, resp. come up with a small NFA..(ii) Estimate the size of minimal NFA’s or find at least a good approxim
