✦ LIBER ✦

Regular languages with variables on graphs

✍ Scribed by Simone Santini

Book ID: 113642017
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 345 KB
Volume: 211
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2011.10.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite graph-acceptors and regular graph

Finite graph-acceptors and regular graph-languages

✍ Kurt-Ulrich Witt 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 595 KB

On languages with two variables

✍ Michael Mortimer 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 500 KB

On graphs with regular groups

✍ Wilfried Imrich 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 466 KB

On fuzzy regular languages

✍ D.S. Malik; John N. Mordeson; M.K. Sen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Odometers on Regular Languages

✍ Valérie Berthé; Michel Rigo 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 431 KB

Learning approximately regular languages

Learning approximately regular languages with reversible languages

✍ Satoshi Kobayashi; Takashi Yokomori 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 490 KB

In this note, we consider the problem of learning approximately regular languages in the limit from positive data using the class of k-reversible languages. The class of k-reversible languages was introduced by Angluin (1982), and proved to be efficiently identifiable in the limit from positive data