✦ LIBER ✦

Axiomatizing the equational theory of regular tree languages

✍ Scribed by Z. Ésik

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The equational theory of regular words

✍ Stephen L. Bloom; Zoltán Ésik 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 331 KB

Minimal equational representations of re

✍ Zoltán Fülöp; Sándor Vágvölgyi 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 428 KB

Stochastic Inference of Regular Tree Lan

✍ Rafael C. Carrasco; Jose Oncina; Jorge Calera-Rubio 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 86 KB

Property Testing of Regular Tree Languag

✍ Frédéric Magniez; Michel de Rougemont 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 491 KB

[Lecture Notes in Computer Science] Auto

✍ Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólf 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 350 KB

Axiomatizing the identities of binoid la

✍ Igor Dolinka 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 315 KB