✦ LIBER ✦

On the Expressiveness of Higher Dimensional Automata: (Extended Abstract)

✍ Scribed by R.J. van Glabbeek

Book ID: 108126461
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 531 KB
Volume: 128
Category: Article
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2004.11.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the expressiveness of higher dimensio

On the expressiveness of higher dimensional automata

✍ R.J. van Glabbeek 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 458 KB

On the Specification of Higher Dimension

On the Specification of Higher Dimensional Automata

✍ Richard Buckland; Michael Johnson; Dominic Verity 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 873 KB

On Improving Backwards Verification of T

On Improving Backwards Verification of Timed Automata (Extended Abstract)

✍ Victor Braberman; Carlos López Pombo; Alfredo Olivero 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 149 KB

On the expressiveness and decidability o

On the expressiveness and decidability of higher-order process calculi

✍ Ivan Lanese; Jorge A. Pérez; Davide Sangiorgi; Alan Schmitt 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 532 KB

On higher eigenvalues of the extended Gr

On higher eigenvalues of the extended Graetz problem

✍ William D. Lakin 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 167 KB

On the complexity of the extended euclid

On the complexity of the extended euclidean algorithm (Extended Abstract)

✍ George Havas 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 92 KB

Euclid's algorithm for computing the greatest common divisor of 2 numbers is considered to be the oldest proper algorithm known ([10]). This algorithm can be amplified naturally in various ways. The GCD problem for more than two numbers is interesting in its own right. Thus, we can use Euclid's algo