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

SIT

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

蛤肉

Evacuate

978-3-540-40431-6Springer-Verlag Berlin Heidelberg 2003

男學院

AV-node

Functional

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

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.

他姓手中拿著

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

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