✦ LIBER ✦

Rewriting preserving recognizability of finite tree languages

✍ Scribed by Vágvölgyi, Sándor

Book ID: 118737110
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 703 KB
Volume: 82
Category: Article
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2012.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal equational representations of re

Minimal equational representations of recognizable tree languages

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

Recognizable languages and finite semila

Recognizable languages and finite semilattices of groups

✍ Gerard Lallement; Elaine Milito 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 176 KB

Projections of languages recognizable by

Projections of languages recognizable by probabilistic and alternating finite multitape automata

✍ Rūsinś Freivalds 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 533 KB

Closures which preserve finiteness in fa

Closures which preserve finiteness in families of languages

✍ Gene F. Rose 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 808 KB

Each set of operations selected from union, intersection, complement, star, quotients, derivatives, word-reversal, and homomorphisms is investigated with respect to its closure of an arbitrary family of word-sets, as well as to its closure of an arbitrary family of regular languages. Certain sets ar