✦ LIBER ✦

A new bound for the D0L sequence equivalence problem

✍ Scribed by Juha Honkala

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 154 KB
Volume: 43
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s00236-006-0028-6

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

A Polynomial Bound for Certain Cases of

A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem

✍ J. Honkala<ORF RID="A1"> 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 58 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 of Polynomially

The Equivalence Problem of Polynomially Bounded D0L Systems— a Bound Depending Only on the Size of the Alphabet

✍ Honkala 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 121 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.

A new upper bound for the bipartite Rams

A new upper bound for the bipartite Ramsey problem

✍ David Conlon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any two‐coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ ≥ 2^_