skip to main content
Language:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search prefilters
Simple Search

Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic

Zantema, Hans

Electronic proceedings in theoretical computer science, 2012-04, Vol.82 (Proc. WRS 2011), p.69-76

Open Publishing Association

Full text available

Citations Cited by
  • Title:
    Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic
  • Author: Zantema, Hans
  • Is Part Of: Electronic proceedings in theoretical computer science, 2012-04, Vol.82 (Proc. WRS 2011), p.69-76
  • Description: In this paper we give a criterion by which one can conclude that every reduction of a basic term to normal form has the same length. As a consequence, the number of steps to reach the normal form is independent of the chosen strategy. In particular this holds for TRSs computing addition and multiplication of natural numbers, both in unary and binary notation.
  • Publisher: Open Publishing Association
  • Language: English
Back to results list
Go to Previous pagePrevious Result  5 NextGo to Next page

  • Implemented by: ABCD-USP USP   Social Network Logos: Freepik

Searching Remote Databases, Please Wait

  • Searching for
  • inscope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
  • Show me what you have so far