𝔖 Bobbio Scriptorium

✦ LIBER ✦

Deciding the immutability of regular codes and languages under finite transductions

✍ Scribed by Tom Head

Book ID: 113163376
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 408 KB
Volume: 31
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90080-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of Regular Language Matching

Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms

✍ Sebastian Bala 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 328 KB