Eylem Seç
On Problems Dual to Unification: The String-Rewriting Case
Başlık:
On Problems Dual to Unification: The String-Rewriting Case
Yazar:
Akçam-Kıbış, Zümrüt, author.
ISBN:
9780438004320
Yazar Ek Girişi:
Fiziksel Tanımlama:
1 electronic resource (55 pages)
Genel Not:
Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Advisors: Paliath Narendran Committee members: Daniel J. Dougherty; Neil V. Murray.
Özet:
Unification, with or without background theories such as associativity and commutativity, is an area of great theoretical and practical interest. Recently unification has become an important tool in areas such as program synthesis and cryptographic protocol analysis.
In this dissertation, we investigate problems which are dual to the unification problem, namely the Fixed Point (FP) problem, Common Term (CT) problem and the Common Equation (CE) problem. We show that the fixed point problem is reducible to the common term problem. We study these three problems for subclasses of convergent string rewriting systems. Our results include: (i) the fixed point problem is undecidable for finite convergent string rewriting systems, (ii) the common term problem is undecidable for the class of dwindling string rewriting systems, and (iii) for the class of finite, monadic and convergent systems, the common equation problem is decidable in polynomial time.
Notlar:
School code: 0668
Konu Başlığı:
Tüzel Kişi Ek Girişi:
Mevcut:*
Yer Numarası | Demirbaş Numarası | Shelf Location | Lokasyon / Statüsü / İade Tarihi |
---|---|---|---|
XX(680523.1) | 680523-1001 | Proquest E-Tez Koleksiyonu | Arıyor... |
On Order
Liste seç
Bunu varsayılan liste yap.
Öğeler başarıyla eklendi
Öğeler eklenirken hata oldu. Lütfen tekrar deneyiniz.
:
Select An Item
Data usage warning: You will receive one text message for each title you selected.
Standard text messaging rates apply.