✦ LIBER ✦

Simple reductions between D0L language and sequence equivalence problems

✍ Scribed by Arto Salomaa

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 245 KB
Volume: 41
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90061-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a bound for the D0L sequence equivale

On a bound for the D0L sequence equivalence problem

✍ A. Ehrenfeucht; G. Rozenberg 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 347 KB

The Equivalence Problem for DF0L Languag

The Equivalence Problem for DF0L Languages and Power Series

✍ Juha Honkala 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 158 KB

We show that equivalence is decidable for D0L systems with finite axiom sets. We discuss also DF0L power series and solve their equivalence problem over computable fields.

On almost cylindrical languages and the

On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems

✍ John Harrison 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 772 KB