Marked PCP is decidable

2001-03-01

Theoretical Computer Science , Volume 255 - Issue 1-2 p. 193- 204

Additional Metadata
MSC	Decidability of theories and sets of sentences (msc 03B25), Thue and Post systems, etc. (msc 03D03), Formal languages and automata (msc 68Q45)
Publisher	Elsevier
Journal	Theoretical Computer Science
Note	Coden: tcscdi
Organisation	Quantum Computing and Advanced System Research
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Halava, V., Hirvensalo, M., & de Wolf, R. (2001). Marked PCP is decidable. Theoretical Computer Science, 255(1-2), 193–204.

Additional Files
Publisher Version

Publication