✦ LIBER ✦

The language equivalence problem for HD0L systems having D0L growths

✍ Scribed by Juha Honkala

Book ID: 108280995
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 190 KB
Volume: 330
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.09.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds for the D0L language equivalence

Bounds for the D0L language equivalence problem

✍ Juha Honkala 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 188 KB

The sequence equivalence problem for pri

The sequence equivalence problem for primitive D0L systems

✍ Juha Honkala 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Simple reductions between D0L language a

Simple reductions between D0L language and sequence equivalence problems

✍ Arto Salomaa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 245 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.

The equivalence problem for deterministi

The equivalence problem for deterministic T0L-systems is undecidable

✍ Grzegorg Rozenberg 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 437 KB

A new bound for the D0L sequence equival

A new bound for the D0L sequence equivalence problem

✍ Juha Honkala 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 154 KB