Relative undecidability in the termination hierarchy of single rewrite rules

A. Geser; A. Middeldorp; E. Ohlebusch; H. Zantema

Relative undecidability in the termination hierarchy of single rewrite rules

A. Geser, A. Middeldorp, E. Ohlebusch, H. Zantema

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	TAPSOFT'97: Theory and Practice of Software Development (Proceedings 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997)
Editors	M. Bidoit, M. Dauchet
Place of Publication	Berlin
Publisher	Springer
Pages	237-248
ISBN (Print)	3-540-62781-2
Publication status	Published - 1997

Publication series

Name	Lecture Notes in Computer Science
Volume	1214
ISSN (Print)	0302-9743

Cite this

Geser, A., Middeldorp, A., Ohlebusch, E., & Zantema, H. (1997). Relative undecidability in the termination hierarchy of single rewrite rules. In M. Bidoit, & M. Dauchet (Eds.), TAPSOFT'97: Theory and Practice of Software Development (Proceedings 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997) (pp. 237-248). (Lecture Notes in Computer Science; Vol. 1214). Springer.

Geser, A. ; Middeldorp, A. ; Ohlebusch, E. et al. / Relative undecidability in the termination hierarchy of single rewrite rules. TAPSOFT'97: Theory and Practice of Software Development (Proceedings 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997). editor / M. Bidoit ; M. Dauchet. Berlin : Springer, 1997. pp. 237-248 (Lecture Notes in Computer Science).

@inproceedings{2c84a8238b124c54a20b0b907db1f862,

title = "Relative undecidability in the termination hierarchy of single rewrite rules",

author = "A. Geser and A. Middeldorp and E. Ohlebusch and H. Zantema",

year = "1997",

language = "English",

isbn = "3-540-62781-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "237--248",

editor = "M. Bidoit and M. Dauchet",

booktitle = "TAPSOFT'97: Theory and Practice of Software Development (Proceedings 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997)",

address = "Germany",

}

Geser, A, Middeldorp, A, Ohlebusch, E & Zantema, H 1997, Relative undecidability in the termination hierarchy of single rewrite rules. in M Bidoit & M Dauchet (eds), TAPSOFT'97: Theory and Practice of Software Development (Proceedings 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997). Lecture Notes in Computer Science, vol. 1214, Springer, Berlin, pp. 237-248.

Relative undecidability in the termination hierarchy of single rewrite rules. / Geser, A.; Middeldorp, A.; Ohlebusch, E. et al.
TAPSOFT'97: Theory and Practice of Software Development (Proceedings 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997). ed. / M. Bidoit; M. Dauchet. Berlin: Springer, 1997. p. 237-248 (Lecture Notes in Computer Science; Vol. 1214).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Relative undecidability in the termination hierarchy of single rewrite rules

AU - Geser, A.

AU - Middeldorp, A.

AU - Ohlebusch, E.

AU - Zantema, H.

PY - 1997

Y1 - 1997

M3 - Conference contribution

SN - 3-540-62781-2

T3 - Lecture Notes in Computer Science

SP - 237

EP - 248

BT - TAPSOFT'97: Theory and Practice of Software Development (Proceedings 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997)

A2 - Bidoit, M.

A2 - Dauchet, M.

PB - Springer

CY - Berlin

ER -

Geser A, Middeldorp A, Ohlebusch E, Zantema H. Relative undecidability in the termination hierarchy of single rewrite rules. In Bidoit M, Dauchet M, editors, TAPSOFT'97: Theory and Practice of Software Development (Proceedings 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997). Berlin: Springer. 1997. p. 237-248. (Lecture Notes in Computer Science).