MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Marked PCP is decidable." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

5 documents found, showing 1 through 5.

ATOM

Marked PCP is Decidable
by Vesa Halava, Mika Hirvensalo, Ronald De Wolf — 1999
…Marked PCP is Decidable Vesa Halava a , Mika Hirvensalo b;a;1 , Ronald de Wolf c;d a Turku…
Add To MetaCart

Decidability and Undecidability of Marked PCP
by Vesa Halava, Th Aeoor, Mika Hirvensalo, Turku Centre, Computer Science, Ronald De Wolf — 1998
…Decidability and Undecidability of Marked PCP Vesa Halava Turku Centre for Computer Science…
Cited by 4 (3 self) – Add To MetaCart

Some New Results on Post Correspondence Problem and Its Modifications
by Vesa Halava, Tero Harju, Turku Centre, Computer Science — 2001 — Bull. Eur. Assoc. Theor. Comput. Sci. EATCS
… Wolf [4] proved that the PCP is decidable if we assume that the morphisms are marked. Moreover, Halava…
Cited by 1 (0 self) – Add To MetaCart

Infinite solutions of marked Post Correspondence Problem
by Vesa Halava, Tero Harju, Turku Centre, Computer Science — 2001 — Formal and Natural Computing Essays Dedicated to Grzegorz Rozenberg
… are prex morphisms (or even biprex). It is known that the PCP is decidable for marked morphisms, see [4…
Cited by 3 (1 self) – Add To MetaCart

Binary (Generalized) Post Correspondence Problem
by Vesa Halava, Tero Harju, Mika Hirvensalo — 2000 — In Proceedings of 13th STACS
… one letter solution. This proves the case (ii). Theorem 2. The marked PCP is decidable. 7 Proof…
Cited by 10 (5 self) – Add To MetaCart

Showing 1 through 5.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB