✦ LIBER ✦

Algorithmic ways of deciding whether an infinite language is a code

✍ Scribed by N. Z. Gabbasov

Publisher: Springer US
Year: 1995
Tongue: English
Weight: 196 KB
Volume: 74
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf02367716

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

It is decidable whether the image of an

It is decidable whether the image of an N-rational sequence has a base

✍ Juha Honkala 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 172 KB

We give a method to decide whether or not the image of a given N-rational sequence can be recognized in some base. In the positive case the bases can be computed effectively.