Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Programming Languages

arXiv:2211.12225v1 (cs)
[Submitted on 22 Nov 2022]

Title:Reversible Programming: A Case Study of Two String-Matching Algorithms

Authors:Robert Glück (Copenhagen University), Tetsuo Yokoyama (Nanzan University)
View PDF
Abstract:String matching is a fundamental problem in algorithm. This study examines the development and construction of two reversible string-matching algorithms: a naive string-matching algorithm and the Rabin-Karp algorithm. The algorithms are used to introduce reversible computing concepts, beginning from basic reversible programming techniques to more advanced considerations about the injectivization of the polynomial hash-update function employed by the Rabin-Karp algorithm. The results are two clean input-preserving reversible algorithms that require no additional space and have the same asymptotic time complexity as their classic irreversible originals. This study aims to contribute to the body of reversible algorithms and to the discipline of reversible programming.
Comments: In Proceedings HCVS/VPT 2022, arXiv:2211.10675
Subjects: Programming Languages (cs.PL); Data Structures and Algorithms (cs.DS)
ACM classes: D.3; I.1.2; F.2.2; D.1
Cite as: arXiv:2211.12225 [cs.PL]
  (or arXiv:2211.12225v1 [cs.PL] for this version)
  https://doi.org/10.48550/arXiv.2211.12225
Journal reference: EPTCS 373, 2022, pp. 1-13
Related DOI: https://doi.org/10.4204/EPTCS.373.1

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Tue, 22 Nov 2022 12:32:38 UTC (23 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.PL
< prev   |   next >
new | recent | 2022-11
Change to browse by:
cs
cs.DS

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)