✦ LIBER ✦

Computing the Rabin Index of a Regular Language of Infinite Words

✍ Scribed by Thomas Wilke; Haiseung Yoo

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the edit distance of a regular

✍ Stavros Konstantinidis 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 216 KB

On the computational complexity of infin

✍ Pavol Ďuriš; Ján Maňuch 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 132 KB

On the number of occurrences of a symbol

✍ Alberto Bertoni; Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 351 KB

A new dichotomic algorithm for the unifo

✍ Oudinet, Johan; Denise, Alain; Gaudel, Marie-Claude 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 470 KB

On the computation of quotients and fact

✍ Marin, Mircea ;Kutsia, Temur 📂 Article 📅 2010 🏛 Higher Education Press and Springer 🌐 English ⚖ 216 KB

A framework to visualize equivalences be

✍ Mauricio Ayala-Rincón; Alexsandro F. da Fonseca; Haydée Werneck Poubel; José Siq 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 258 KB