Non-termination using regular languages

J. Endrullis; H. Zantema

Non-termination using regular languages

J. Endrullis
, H. Zantema

Formal System Analysis

Research output: Book/Report › Report › Academic

106 Downloads (Pure)

Abstract

We describe a method for proving non-termination of term rewriting systems that do not admit looping reductions. As certi¿cates of non-termination, we employ regular (tree) automata.

Original language	English
Publisher	s.n.
Number of pages	6
Publication status	Published - 2014

Publication series

Name	arXiv
Volume	1405.5662 [cs.LO]

Access to Document

569857678603392Final published version, 307 KB

Cite this

@book{370d7665cb614a97a0b41fb588ed2279,

title = "Non-termination using regular languages",

abstract = "We describe a method for proving non-termination of term rewriting systems that do not admit looping reductions. As certi¿cates of non-termination, we employ regular (tree) automata.",

author = "J. Endrullis and H. Zantema",

year = "2014",

language = "English",

series = "arXiv",

publisher = "s.n.",

}

TY - BOOK

T1 - Non-termination using regular languages

AU - Endrullis, J.

AU - Zantema, H.

PY - 2014

Y1 - 2014

N2 - We describe a method for proving non-termination of term rewriting systems that do not admit looping reductions. As certi¿cates of non-termination, we employ regular (tree) automata.

AB - We describe a method for proving non-termination of term rewriting systems that do not admit looping reductions. As certi¿cates of non-termination, we employ regular (tree) automata.

M3 - Report

T3 - arXiv

BT - Non-termination using regular languages

PB - s.n.

ER -

Non-termination using regular languages

Abstract

Publication series

Access to Document

Fingerprint

Cite this