✦ LIBER ✦

The complexity of Free-Flood-It on boards

✍ Scribed by Meeks, Kitty; Scott, Alexander

Book ID: 123152848
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 390 KB
Volume: 500
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.06.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of flood-filling games on

The complexity of flood-filling games on graphs

✍ Kitty Meeks; Alexander Scott 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 271 KB

The Complexity of Flood Filling Games

✍ Raphaël Clifford; Markus Jalsenius; Ashley Montanaro; Benjamin Sach 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 668 KB

Spanning Trees and the Complexity of Flo

Spanning Trees and the Complexity of Flood-Filling Games

✍ Kitty Meeks, Alexander Scott 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 730 KB

On the complexity of regulated context-f

On the complexity of regulated context-free rewriting

✍ A.B. Cremers; O. Mayer; K. Weiss 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 390 KB

On the Tape Complexity of Deterministic

On the Tape Complexity of Deterministic Context-Free Languages

✍ Sudborough, I. H. 📂 Article 📅 1978 🏛 Association for Computing Machinery 🌐 English ⚖ 691 KB

On the context-free production complexit

On the context-free production complexity of finite languages

✍ Zsolt Tuza 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 696 KB

The following problem is investigated. Let L be a given finite language, LcL,= {ub: I ~o,bsn, of/~}. Determine the minimal natural number c(L) such that L can be generated by c(L) context-free productions. Among others, max c(L) = O(n'/log n) is proved, and languages satisfying c(L) = IL) are charac