On the Decidability of Bounded Valuedness for Transducers

Sakarovitch, Jacques; Souza, Rodrigo de

doi:10.1007/978-3-540-85238-4_48

Cited by 24 publications

(19 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The class of bounded-valued nfts has been extensively studied in the literature [15], [12]. The class of bounded-valued nssts promises to be a robust class.…”

Section: Discussionmentioning

confidence: 99%

“…Unlike the class of k-valued nssts, it is closed under sequential composition. In both [15] and [12], it is shown that the problem of checking if an nft is bounded-valued can be checked in polynomial time by verifying certain conditions on the structure of its transition diagram. We believe that it may be possible to generalize these conditions to characterize bounded-valuedness of nssts.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Nondeterministic Streaming String Transducers

Alur

Deshmukh

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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.

show abstract

“…The class of bounded-valued nfts has been extensively studied in the literature [15], [12]. The class of bounded-valued nssts promises to be a robust class.…”

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Nondeterministic Streaming String Transducers

Alur

Deshmukh

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The polynomials for testing bounded valuedness of tree transducers are much higher than for testing bounded ambiguity for tree automata [23].…”

Section: Theoremmentioning

confidence: 99%

Bounded Delay and Concurrency for Earliest Query Answering

Gauwin

Niehren

Tison

2009

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Abstract. Earliest query answering is needed for streaming XML processing with optimal memory management. We study the feasibility of earliest query answering for node selection queries. Tractable queries are distinguished by a bounded number of concurrently alive answer candidates at every time point, and a bounded delay for node selection. We show that both properties are decidable in polynomial time for queries defined by deterministic automata for unranked trees. Our results are obtained by reduction to the bounded valuedness problem for recognizable relations between unranked trees.

show abstract

“…Notably, it is decidable whether a NFT transduction is k-valued and their equivalence and inclusion problems are decidable Theorem 3.1.29 (k-valuedness). [GI83,Web89,SdS08] It is decidable in PTime whether an NFT T is finite valued, that is, whether there exists a k ∈ N such that T is k-valued. Let k ∈ N be fixed.…”

Section: K-valued Nftmentioning

confidence: 99%