Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2018.13
URN: urn:nbn:de:0030-drops-91831
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9183/
Czajka, Lukasz
Term Rewriting Characterisation of LOGSPACE for Finite and Infinite Data
| pdf-format: |
|
Abstract
We show that LOGSPACE is characterised by finite orthogonal tail-recursive cons-free constructor term rewriting systems, contributing to a line of research initiated by Neil Jones. We describe a LOGSPACE algorithm which computes constructor normal forms. This algorithm is used in the proof of our main result: that simple stream term rewriting systems characterise LOGSPACE-computable stream functions as defined by Ramyaa and Leivant. This result concerns characterising logarithmic-space computation on infinite streams by means of infinitary rewriting.
BibTeX - Entry
@InProceedings{czajka:LIPIcs:2018:9183,
author = {Lukasz Czajka},
title = {{Term Rewriting Characterisation of LOGSPACE for Finite and Infinite Data}},
booktitle = {3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)},
pages = {13:1--13:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-077-4},
ISSN = {1868-8969},
year = {2018},
volume = {108},
editor = {H{\'e}l{\`e}ne Kirchner},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9183},
URN = {urn:nbn:de:0030-drops-91831},
doi = {10.4230/LIPIcs.FSCD.2018.13},
annote = {Keywords: LOGSPACE, implicit complexity, term rewriting, infinitary rewriting, streams}
}
| Keywords: | LOGSPACE, implicit complexity, term rewriting, infinitary rewriting, streams | |
| Seminar: | 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 04.07.2018 |
