Nondeterministic Streaming String Transducers

Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
CPS Theory
Computer Sciences
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Deshmukh, Jyotirmoy
Contributor
Abstract

We introduce nondeterministic streaming string transducers (NSSTs) { a new computational model that can implement MSO-definable relations between strings. An NSST makes a single left-to-right pass on the input string and uses a finite set of string variables to compute the output. In each step, it reads one input symbol, and updates its string variables in parallel with a copyless assignment.We show that the expressive power of NSST coincides with that of nondeterministic MSO-definable transductions. Further, we identify the class of functional NSST; these allow nondeterministic transitions, but for every successful run on a given input generates the same output string. We show that deciding functionality of an arbitrary NSST is decidable with PSPACE complexity, while the equivalence problem for functional NSST is PSPACE-complete. We also show that checking if the set of outputs of an NSST is contained within the set of outputs of a finite number of DSSTs is decidable in PSPACE.

Advisor
Date of presentation
2011-07-01
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-17T07:10:53.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
From the 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011.
Recommended citation
Collection