標(biāo)題: Titlebook: Developments in Language Theory; 6th International Co Masami Ito,Masafumi Toyama Conference proceedings 2003 Springer-Verlag Berlin Heidelb [打印本頁] 作者: cerebral-cortex 時間: 2025-3-21 16:14
書目名稱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é)科排名
作者: 寬敞 時間: 2025-3-21 21:12
Experimental Quantum Computation with Moleculesring came up with his computation model which is now widely used and referred to as a Turing machine in 1936, he emulated human calculation process. At that time, quantum mechanics was already born and rapidly gaining the position of the most fundamental law of physics. However human thoughts were a作者: 大門在匯總 時間: 2025-3-22 01:53
Efficient Transformations from Regular Expressions to Finite Automatanumber of transitions) of the resulting automata, and on the time complexity of the transformation..We show how recent developments [.],[.] have improved the size of the resulting automaton from .(..) to .(.(log .).), and even .(. log .) for bounded alphabet size (where . is the size of the regular 作者: strdulate 時間: 2025-3-22 06:54 作者: Generic-Drug 時間: 2025-3-22 10:01
Infinite Snake Tiling Problemstical colors in their adjacent edges. A snake is a non-overlapping sequence of tiles. We show that it is undecidable if such snakes or cycles are possible using copies of tiles from a given finite tile collection.作者: SPECT 時間: 2025-3-22 16:03
Decision Problems for Linear and Circular Splicing Systemss. A DNA strand can be viewed as a string over a four letter alphabet (the four deoxyribonucleotides), therefore we can model DNA computation within the framework of formal language theory. In spite of a vast literature on splicing systems, briefly surveyed here, a few problems related to their comp作者: SPECT 時間: 2025-3-22 17:42
Some Properties of Ciliate Bio-operationshe correct order and deleting non-coding sequences from an “encrypted” version of a DNA strand, has been modeled and studied so far from the point of view of the computational power of the DNA bio-operations involved. Here we concentrate on a different aspect of the process, by considering only the 作者: 高歌 時間: 2025-3-22 22:37 作者: 遵循的規(guī)范 時間: 2025-3-23 04:29
Carriers and Counters maximal parallelism required in the application of the rules. In fact, with a single carrier, these systems are equivalent to blind counter automata. Finally, with a single passenger restriction the systems are again computationally complete.作者: Metastasis 時間: 2025-3-23 05:40 作者: Bumble 時間: 2025-3-23 11:29
Unary Language Operations and Their Nondeterministic State Complexityeterministic finite automata. In particular, we consider Boolean operations, concatenation, iteration, and λ-free iteration. Most of the bounds are tight in the exact number of states, i.e. the number is sufficient and necessary in the worst case. For the complementation of infinite languages a tigh作者: floodgate 時間: 2025-3-23 15:31 作者: Insatiable 時間: 2025-3-23 20:32
Roots and Powers of Regular Languagesive words . such that .. belongs to . for some . ≥ 1. There is a strong connection between the root and the powers of a regular language . namely, the .-power of . for an arbitrary finite set . with 0, 1, 2 ?, . is regular if and only if the root of . is finite. If the root is infinite then the .-po作者: PRISE 時間: 2025-3-23 23:15
Efficient Transformations from Regular Expressions to Finite Automataved the size of the resulting automaton from .(..) to .(.(log .).), and even .(. log .) for bounded alphabet size (where . is the size of the regular expression). A lower bound [.] shows this to be close to optimal, and also one of those constructions can be computed in optimal time [.].作者: ETCH 時間: 2025-3-24 02:57
Decision Problems for Linear and Circular Splicing Systemshe framework of formal language theory. In spite of a vast literature on splicing systems, briefly surveyed here, a few problems related to their computational power are still open. We intend to evidence how classical techniques and concepts in automata theory are a legitimate tool for investigating some of these problems.作者: commensurate 時間: 2025-3-24 07:13 作者: figment 時間: 2025-3-24 13:11
Roots and Powers of Regular Languages .-power of . for an arbitrary finite set . with 0, 1, 2 ?, . is regular if and only if the root of . is finite. If the root is infinite then the .-power for most regular sets . is context-sensitive but not context-free. The stated property is decidable.作者: 上腭 時間: 2025-3-24 16:44 作者: 反省 時間: 2025-3-24 19:39
Wie Jungen mit Wrestling umgehennsional stochastic Turing machines (2-stm’s)”, and shows that for any . ≤ .(.) = .(.), .(.) space-bounded 2-ptm’s with bounded error are less powerful than .(.) space-bounded 2-stm’s with bounded error which start in nondeterministic mode, and make only one alternation between nondeterministic and probabilistic modes.作者: 邊緣 時間: 2025-3-25 01:33
Rousseau, Schiller, Herder, Heinseved the size of the resulting automaton from .(..) to .(.(log .).), and even .(. log .) for bounded alphabet size (where . is the size of the regular expression). A lower bound [.] shows this to be close to optimal, and also one of those constructions can be computed in optimal time [.].作者: 一起平行 時間: 2025-3-25 03:50
Bernhard B?schenstein,Ulrich Gaierhe framework of formal language theory. In spite of a vast literature on splicing systems, briefly surveyed here, a few problems related to their computational power are still open. We intend to evidence how classical techniques and concepts in automata theory are a legitimate tool for investigating some of these problems.作者: 價值在貶值 時間: 2025-3-25 07:46
https://doi.org/10.1007/978-3-476-99053-2s. We prove that up to an initial part any natural number can occur as complexity of some language. Moreover, we show the existence of languages with small descriptional complexity with respect to one mechanism and large complexity with respect to the other device.作者: 反話 時間: 2025-3-25 14:06
Wie Jungen mit Wrestling umgehen .-power of . for an arbitrary finite set . with 0, 1, 2 ?, . is regular if and only if the root of . is finite. If the root is infinite then the .-power for most regular sets . is context-sensitive but not context-free. The stated property is decidable.作者: 臨時抱佛腳 時間: 2025-3-25 16:13 作者: stress-test 時間: 2025-3-25 22:07
A Space Lower Bound of Two-Dimensional Probabilistic Turing Machinesnsional stochastic Turing machines (2-stm’s)”, and shows that for any . ≤ .(.) = .(.), .(.) space-bounded 2-ptm’s with bounded error are less powerful than .(.) space-bounded 2-stm’s with bounded error which start in nondeterministic mode, and make only one alternation between nondeterministic and probabilistic modes.作者: CODE 時間: 2025-3-26 01:34
Ulrich Gaier,Valérie Lawitschkahs contain strings and graphs that do not model any micronuclear gene. After a short survey of gene assembly we study the problem of recognizing whether a general legal string or a general overlap graph is a formalization of a micronuclear gene.作者: thrombosis 時間: 2025-3-26 04:23
Computational Processes in Living Cells: Gene Assembly in Ciliateshs contain strings and graphs that do not model any micronuclear gene. After a short survey of gene assembly we study the problem of recognizing whether a general legal string or a general overlap graph is a formalization of a micronuclear gene.作者: Fibroid 時間: 2025-3-26 11:20 作者: IDEAS 時間: 2025-3-26 15:20 作者: FEMUR 時間: 2025-3-26 18:21 作者: CORD 時間: 2025-3-26 23:35
Constructing Infinite Words of Intermediate Complexity作者: inferno 時間: 2025-3-27 03:01 作者: Finasteride 時間: 2025-3-27 05:46
Zur Geschichte des H?lderlinschen NachlassesWe associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.作者: conduct 時間: 2025-3-27 11:14 作者: 倔強一點 時間: 2025-3-27 16:27 作者: 開始從未 時間: 2025-3-27 18:06 作者: Cognizance 時間: 2025-3-28 01:50
H?llen-Inszenierung ?Wrestling“We improve the known bounds on the number of pairwise non-isomorphic minimal deterministic finite automata (DFAs) on . states which accept finite languages. The lower bound constructions are iterative approaches which yield recurrence relations.作者: 清洗 時間: 2025-3-28 02:56 作者: Exterior 時間: 2025-3-28 07:37
Finite Automata Models of Quantized Systems: Conceptual Status and OutlookSince Edward Moore, finite automata theory has been inspired by physics, in particular by quantum complementarity. We review automaton complementarity, reversible automata and the connections to generalized urn models. Recent developments in quantum information theory may have appropriate formalizations in the automaton context.作者: 警告 時間: 2025-3-28 12:50
Automata on Linear OrderingsWe consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce automata and rational expressions for words on linear orderings.作者: SIT 時間: 2025-3-28 18:20
Undecidability of Weak Bisimilarity for PA-ProcessesWe prove that the problem whether two PA-processes are weakly bisimilar is undecidable. We combine several proof techniques to provide a reduction from Post’s correspondence problem to our problem: existential quantification technique, masking technique and deadlock elimination technique.作者: STENT 時間: 2025-3-28 22:07 作者: 蛤肉 時間: 2025-3-28 23:15 作者: Evacuate 時間: 2025-3-29 03:07
978-3-540-40431-6Springer-Verlag Berlin Heidelberg 2003作者: 男學(xué)院 時間: 2025-3-29 10:32 作者: AV-node 時間: 2025-3-29 12:47 作者: Functional 時間: 2025-3-29 19:03
Rousseau, Schiller, Herder, Heinsenumber of transitions) of the resulting automata, and on the time complexity of the transformation..We show how recent developments [.],[.] have improved the size of the resulting automaton from .(..) to .(.(log .).), and even .(. log .) for bounded alphabet size (where . is the size of the regular 作者: Allure 時間: 2025-3-29 20:13
Rousseau, Schiller, Herder, Heinsenown linear time algorithm for quadratic word equations with length constraints to cope with involutions. Finally, we show that the same linear-time result cannot be expected for trace equations. We obtain an NP-hardness result.作者: 他姓手中拿著 時間: 2025-3-30 02:00
Rousseau, Schiller, Herder, Heinsetical colors in their adjacent edges. A snake is a non-overlapping sequence of tiles. We show that it is undecidable if such snakes or cycles are possible using copies of tiles from a given finite tile collection.作者: Immobilize 時間: 2025-3-30 04:32
Bernhard B?schenstein,Ulrich Gaiers. A DNA strand can be viewed as a string over a four letter alphabet (the four deoxyribonucleotides), therefore we can model DNA computation within the framework of formal language theory. In spite of a vast literature on splicing systems, briefly surveyed here, a few problems related to their comp作者: 淘氣 時間: 2025-3-30 10:24 作者: 復(fù)習(xí) 時間: 2025-3-30 15:56 作者: Water-Brash 時間: 2025-3-30 20:12 作者: Conserve 時間: 2025-3-30 23:06 作者: Magisterial 時間: 2025-3-31 02:32
The Dionysiac Chronotope (Pre-1799–1799)eterministic finite automata. In particular, we consider Boolean operations, concatenation, iteration, and λ-free iteration. Most of the bounds are tight in the exact number of states, i.e. the number is sufficient and necessary in the worst case. For the complementation of infinite languages a tigh作者: 細(xì)頸瓶 時間: 2025-3-31 07:59
Wie Jungen mit Wrestling umgehenand shows, using this space lower bound theorem, that a specific set is not recognized by any .(.) space-bounded 2- ptm. Furthermore, the paper investigates a relationship between 2-ptm‘s and two-dimensional Turing machines with both nondeterministic and probabilistic states, which we call “two-dime作者: landfill 時間: 2025-3-31 12:52 作者: 蒼白 時間: 2025-3-31 14:28
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/270244.jpg作者: Exaggerate 時間: 2025-3-31 18:45
A Remark about Quadratic Trace Equationsnown linear time algorithm for quadratic word equations with length constraints to cope with involutions. Finally, we show that the same linear-time result cannot be expected for trace equations. We obtain an NP-hardness result.作者: 錯誤 時間: 2025-4-1 00:45 作者: ungainly 時間: 2025-4-1 03:40
Carriers and Counters maximal parallelism required in the application of the rules. In fact, with a single carrier, these systems are equivalent to blind counter automata. Finally, with a single passenger restriction the systems are again computationally complete.作者: 淡紫色花 時間: 2025-4-1 09:05
