✦ LIBER ✦

On a bound for the D0L sequence equivalence problem

✍ Scribed by A. Ehrenfeucht; G. Rozenberg

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 347 KB
Volume: 12
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90064-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

On the equivalence problem for regular T

On the equivalence problem for regular Thue systems

✍ Paliath Narendran 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 531 KB

A branch and bound algorithm for the min

A branch and bound algorithm for the minimum storage-time sequencing problem

✍ P. Detti; D. Pacciarelli 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

A problem of L. L. Campbell on the equiv

A problem of L. L. Campbell on the equivalence of the Kramer and Shannon sampling theorems

✍ M. Genuit; G. Schöttler 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 556 KB

A note on unbiased testing for the equiv

A note on unbiased testing for the equivalence problem — another christmas tree

✍ Axel Munk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 290 KB