✦ LIBER ✦

Decidability of the termination problem for completely specified protocols

✍ Scribed by Alain Finkel

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 854 KB
Volume: 7
Category: Article
ISSN: 0178-2770
DOI: 10.1007/bf02277857

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Mailbox¶The decidability of the affine c

Mailbox¶The decidability of the affine completeness generation problem

✍ Kalle Kaarli; Alden Pixley 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 125 KB

On the decidability of the word problem

On the decidability of the word problem for

✍ M. Mazzucchelli; A. Cherubini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 506 KB

On the classification of bases inPkaccor

On the classification of bases inPkaccording to the decidability of the completeness problem for automata

✍ D. N. Babin 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 187 KB

On decidability of the decomposability p

On decidability of the decomposability problem for finite theories

✍ Andrey S. Morozov; Denis K. Ponomaryov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 181 KB

Decidable, polynomial-time, and np-compl

Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem

✍ V. G. Timkovskii; L. V. Knyazeva 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 844 KB

Decidability of the consistency problem

Decidability of the consistency problem for regular symbolic picture description languages

✍ G. Costagliola; V. Deufemia; F. Ferrucci; C. Gravino 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 86 KB

In the paper we address the consistency problem for drawn symbolic picture grammars. In particular we prove that it is always possible to decide whether or not a regular grammar generates only consistent descriptions of drawn symbolic pictures.