✦ LIBER ✦

An algorithm to decide whether a rational subset of Nk is recognizable

✍ Scribed by Philippe Gohon

Book ID: 107948528
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 483 KB
Volume: 41
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90059-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithmic ways of deciding whether an

Algorithmic ways of deciding whether an infinite language is a code

✍ N. Z. Gabbasov 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 196 KB

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.

An algorithm to establish whether a give

An algorithm to establish whether a given rectangular array is a sub-array of a rectangular array also given

✍ M. Italiani; A. Sella 📂 Article 📅 1980 🏛 Springer Milan 🌐 English ⚖ 231 KB

MAGNA CARTAThe Great CharterPreamble

📂 Fiction 🌐 English ⚖ 11 KB 👁 18 views