Titlebook: Developments in Language Theory; 6th International Co Masami Ito,Masafumi Toyama Conference proceedings 2003 Springer-Verlag Berlin Heidelb

cerebral-cortex

书目名称Developments in Language Theory影响因子(影响力)




书目名称Developments in Language Theory影响因子(影响力)学科排名




书目名称Developments in Language Theory网络公开度




书目名称Developments in Language Theory网络公开度学科排名




书目名称Developments in Language Theory被引频次




书目名称Developments in Language Theory被引频次学科排名




书目名称Developments in Language Theory年度引用




书目名称Developments in Language Theory年度引用学科排名




书目名称Developments in Language Theory读者反馈




书目名称Developments in Language Theory读者反馈学科排名

宽敞

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

大门在汇总

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

Generic-Drug

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

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

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

高歌

遵循的规范

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