On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions

DOI10.3233/FI-2015-1219zbMath1334.68313arXiv1402.4950OpenAlexW1569457587MaRDI QIDQ2804184

Jan A. Bergstra, C. A. Middelburg

Publication date: 28 April 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.4950

zbMATH Keywords

single-pass instruction sequencebit string functionstructural algorithmic equivalencestructural computational equivalence

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (1)

On the complexity of the correctness problem for non-zeroness test instruction sequences

This page was built for publication: On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions