We shall show that it is decidable for binary instances of the Post Correspondence Problem whether the instance has an inÿnite solution. In this context, a binary instance (h; g) consists of two morphisms h and g with a common two element domain alphabet. An inÿnite solution ! is an inÿnite word ! =
The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems
✍ Scribed by Vesa Halava; Tero Harju; Juhani Karhumäki
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 165 KB
- Volume
- 40
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The use of hypothesis verification is recurrent in the model-based recognition literature. Verification consists in measuring how many model features transformed by a pose coincide with some image features. When data involved in the computation of the pose are noisy, the pose is inaccurate and diffi
Many papers in economics have been written using optimal control theory with what appear to be diverse models. The qualitative results developed in the papers have been related only to the specific model at hand. This paper shows that most of the useful qualitative results occur because the same sma
The method of singular integral equations is an efficient method for the formulation and numerical solution of plane and antiplane, static and dynamic, isotropic and anisotropic elasticity problems. Here we consider three cases of singular loadings of the elastic medium: by a force, by a moment and