Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
Decision problems for semi-Thue systems with a few rules |
| Συγγραφείς: |
Matiyasevich, Yuri1 http://logic.pdmi.ras.ru/~yumat, Sénizergues, Géraud2 http://dept-info.labri.u-bordeaux.fr/~ges |
| Πηγή: |
Theoretical Computer Science. Jan2005, Vol. 330 Issue 1, p145-169. 25p. |
| Θεματικοί όροι: |
*Sequential machine theory, *Programmable sequence controllers, *Computers, *Turing machines |
| Περίληψη: |
Abstract: We show that the accessibility problem, the common descendant problem, the termination problem and the uniform termination problem are undecidable for 3-rules semi-Thue systems. As a corollary we obtain the undecidability of the Post correspondence problem for 7 rules. [Copyright &y& Elsevier] |
| Βάση Δεδομένων: |
Academic Search Index |