✦ LIBER ✦

The upper bound of K in K-lossless sequential machines

✍ Scribed by Yahiko Kambayashi; Shuzo Yajima

Book ID: 114036871
Publisher: Elsevier Science
Year: 1971
Weight: 216 KB
Volume: 19
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(71)90695-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds on the size of LR(k) parser

Upper bounds on the size of LR(k) parsers

✍ Esko Ukkonen 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 337 KB

Upper bound of I = 0 exchange in Kπ scat

Upper bound of I = 0 exchange in Kπ scattering

✍ B. Bonnier; N. Johannesson 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 230 KB

An upper bound for the k-domination numb

An upper bound for the k-domination number of a graph

✍ E. J. Cockayne; B. Gamble; B. Shepherd 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The kdomination number of a graph G, y k ( G ) , is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k. then YAG) 5 kp/(k + 1).

Aspects of the Upper Bounds of Finite In

Aspects of the Upper Bounds of Finite Input-Memory and Finite Output-Memory Sequential Machines

✍ Freeman, M. 📂 Article 📅 1979 🏛 IEEE 🌐 English ⚖ 892 KB

Spectral upper bounds for the order of a

Spectral upper bounds for the order of a k-regular induced subgraph

✍ Domingos M. Cardoso; Peter Rowlinson 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Upper Bounds to the Number of Vertices i

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

✍ Matthias Kriesell 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 145 KB