Reachability and confluence are undecidable for flat term rewriting systems

Author: Jacquemard, F.

Source: Information Processing Letters, Volume 87, Number 5, 15 September 2003 , pp. 265-270(6)

Publisher: Elsevier

Buy & download fulltext article:

The full text link is not available.

We are currently unable to link to the full text of this article. If you continue to receive this message, please contact

Keywords: Term rewriting; Theory of computation

Document Type: Short Communication

Publication date: September 15, 2003

Related content



Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page