Abstract

Foundational work on stream processing is relevant for different areas of AI and it becomes even more relevant if the work concerns feasible and scalable stream processing. One facet of feasibility is treated under the term bounded memory. In this paper, streams are represented as finite or infinite words and stream processing is modelled with stream functions, i.e., functions mapping one or more input stream to an output stream. Bounded-memory stream functions can process input streams by using constant space only. The main result of this paper is a syntactical characterization of bounded-memory functions by a form of safe recursion.
Original languageEnglish
Title of host publicationKI 2018: Advances in Artificial Intelligence
EditorsFrank Trollmann, Anni-Yasmin Turhan
Number of pages14
Volume11117
Place of PublicationCham
PublisherSpringer International Publishing
Publication date30.08.2018
Pages377-390
ISBN (Print)978-3-030-00110-0
ISBN (Electronic)978-3-030-00111-7
DOIs
Publication statusPublished - 30.08.2018
Event41st German Conference on Artificial Intelligence
- Berlin, Germany
Duration: 24.09.201828.09.2018
Conference number: 218679

DFG Research Classification Scheme

  • 409-01 Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Bounded-Memory Stream Processing'. Together they form a unique fingerprint.

Cite this