The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

## Filters

##
###
MSO definable string transductions and two-way finite state transducers
[article]

1999
*
arXiv
*
pre-print

Nondeterministic

arXiv:cs/9906007v1
fatcat:3lvlzq6tuncbzgp5kdgzq4v7pa
*mso**definable**string**transductions*(i.e., those*definable*with the use of parameters) correspond to compositions of*two*nondeterministic*two*-*way**finite**state**transducers*that have the ...*String**transductions*that are*definable*in monadic second-order (*mso*) logic (without the use of parameters) are exactly those realized by deterministic*two*-*way**finite**state**transducers*. ... A*two*-*way**finite**state**transducer*(or*two*-*way*generalized sequential machine, 2gsm) is a*finite**state*automaton equipped with a*two*-*way*input tape,*and*a one-*way*output tape. ...##
###
Regular Transformations of Data Words Through Origin Information
[chapter]

2016
*
Lecture Notes in Computer Science
*

We introduce a class of transformations of

doi:10.1007/978-3-662-49630-5_17
fatcat:5z2rbonetraybbhzg7gqfv6zti
*finite*data words generalizing the well-known class of regular*finite**string*transformations described by*MSO*-*definable**transductions*of*finite**strings*. ... As is the case for regular transformations we show that our class of transformations has equivalent characterizations in terms of deterministic*two*-*way**and*streaming*string**transducers*. ...*Two*-*way**transducers*on data words*Two*-*way*deterministic*transducers*on*strings*are known to be equivalent to*MSO**string**transductions*[9] . ...##
###
From Two-Way to One-Way Finite State Transducers

2013
*
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
*

Necessary Condition
The

doi:10.1109/lics.2013.53
dblp:conf/lics/FiliotGRS13
fatcat:kf7l2hwiobeyjafvjurc6shpga
*transduction*must be*definable*by a one-*way**finite**state**transducer*. ... equivalent: 1*two*-*way*DFT 2*MSO**transductions*3 deterministic (one-*way*) streaming*string**transducers*with copyless update Moreover, SSTs have good algorithmic properties*and*have been used to analyse ... ... determinization of one-*way**transducers*: TP is too strong q0 start q1 start a|aa a|a deterministic 2way < functional 2way: It is possible to simulate a z-motion run with a one-*way*automaton 1 each*state*...##
###
Expressiveness of streaming string transducers

2010
*
Foundations of Software Technology and Theoretical Computer Science
*

Such regular

doi:10.4230/lipics.fsttcs.2010.1
dblp:conf/fsttcs/AlurC10
fatcat:ulbfpf756za6jfzumszidwat4m
*transductions*can be*defined*either by*two*-*way*deterministic*finite*-*state**transducers*, or using a logical*MSO*-based characterization. ... Such regular*transductions*can be*defined*either by*two*-*way*deterministic*finite*-*state**transducers*, or using a logical*MSO*-based characterization. ... We briefly review*two*equivalent*ways*of*defining*deterministic*transductions*using*two*-*way**finite*-*state**transducers**and*using monadic second-order logic (*MSO*),*and*some known results (the details can ...##
###
The Many Facets of String Transducers (Invited Talk)

2019
*
Symposium on Theoretical Aspects of Computer Science
*

In this paper we survey some older

doi:10.4230/lipics.stacs.2019.2
dblp:conf/stacs/MuschollP19
fatcat:ir6th7r24vfjhlz6clrybdsmfu
*and*more recent results on*string**transducers*. ... We present classical connections between automata, logic*and*algebra extended to*transducers*, some genuine*definability*questions,*and*review approaches to the equivalence problem. ... Mazowiecki*and*I. Walukiewicz, for their comments on a draft version of this paper. ...##
###
Page 2319 of Mathematical Reviews Vol. , Issue 2003d
[page]

2003
*
Mathematical Reviews
*

realized by deter- ministic

*two*-*way**finite*-*state**transducers*, i.e.,*finite*-*state*automata with a*two*-*way*input tape*and*a one-*way*output tape. ... by nondeterministic*two*-*way**finite*-*state**transducers*. ...##
###
Transducers with origin information
[article]

2013
*
arXiv
*
pre-print

Call a

arXiv:1309.6124v1
fatcat:fmgvkd4bljakjnxy3duw3r3n3a
*string*-to-*string**transducer*regular if it can be realised by one of the following equivalent models:*mso**transductions*,*two*-*way*deterministic automata with output,*and*streaming*transducers*with ... or first-order*definable**transducers*. ... Using the encoding of*strings*as relational structures, copying*mso**transductions*can be used to map*strings*to*strings*. Such a*string*to*string**transducer*is called*mso**definable*. ...##
###
Transducers with Origin Information
[chapter]

2014
*
Lecture Notes in Computer Science
*

Call a

doi:10.1007/978-3-662-43951-7_3
fatcat:h3an2oncpnhrtklufgsxo5fyya
*string*-to-*string*function regular if it can be realised by one of the following equivalent models:*mso**transductions*,*two*-*way*deterministic automata with output,*and*streaming*transducers*with registers ... The motivation of this paper is the simple observation that the models discussed above, namely deterministic*two*-*way*automata with output,*mso**definable**string**transductions*,*and*automata with registers ... A*string*-to-*string*function f is called*mso*-*definable*if there is some copying*mso**transduction*such that for every input*string*w, the*transduction*transforms the relational structure corresponding to ...##
###
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
[article]

2005
*
arXiv
*
pre-print

It is decidable for deterministic

arXiv:cs/0506014v1
fatcat:4v32upvcxbcpdhr3zewaxvuy3a
*MSO**definable*graph-to-*string*or graph-to-tree*transducers*whether they are equivalent on a context-free set of graphs. ... For*string**transducers*this means the following. Corollary 9. It is decidable whether*two*deterministic*two*-*way**finite**state**transducers*are equivalent on an NR set of*strings*. ... They properly contain, for instance, the context-free languages*and*the ranges of deterministic*two*-*way**finite**state**transducers*. ...##
###
Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers

2020
*
International Symposium on Mathematical Foundations of Computer Science
*

We study the following decision problem: given

doi:10.4230/lipics.mfcs.2020.19
dblp:conf/mfcs/BojanczykS20
fatcat:a5itprfdvrgq7il4d4qfp4zomu
*two**mso**transductions*that input*and*output graphs of bounded treewidth, decide if they are equivalent, i.e. isomorphic inputs give isomorphic outputs. ... Applying the above result to the ring Z[x],*and*then the encoding of A in Z[x], we see that equivalence is decidable for register*transducers*over A. ... The mapping should be compositional (the algebraic objects can be synthesised by a register*transducer*that inputs a tree decomposition)*and*have high distinguishing power (ideally, non-isomorphic inputs ...##
###
Regular Transformations of Infinite Strings

2012
*
2012 27th Annual IEEE Symposium on Logic in Computer Science
*

This class can be equivalently

doi:10.1109/lics.2012.18
dblp:conf/lics/AlurFT12
fatcat:c4uu62eylfhhha2vb4qjsskfsm
*defined*using both logic (Monadic secondorder logic)*and**finite*-*state*machines (*two*-*way**transducers*,*and*more recently, streaming*string**transducers*); is closed under operations ... The proof that our model captures all*MSO*-*definable*transformations uses*two*-*way**transducers*. ... The class of regular transformations of*finite**strings*[7] characterized by*MSO**transducers*,*two*-*way**finite*-*state**transducers*,*and*SSTs is closed under operations such as sequential composition*and*regular ...##
###
Copyful Streaming String Transducers
[chapter]

2017
*
Lecture Notes in Computer Science
*

It is known that copyless SST capture exactly the class of

doi:10.1007/978-3-319-67089-8_6
fatcat:idfknjkd2jcm7akfud65v55rmu
*MSO*-*definable**string*-to-*string**transductions*,*and*are as expressive as deterministic*two*-*way**transducers*. ... Copyless streaming*string**transducers*(copyless SST) have been introduced by R. Alur*and*P.Černý in 2010 as a one-*way*deterministic automata model to*define**transductions*of*finite**strings*. ... Hoogeboom that*MSO*-*definable*(*finite*)*string*to*string**transductions*are exactly those*transductions**defined*by deterministic*two*-*way**transducers*[11] . ...##
###
Two-Way Visibly Pushdown Automata and Transducers

2016
*
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16
*

*two*-

*way*

*transducers*, monadic second-order (

*MSO*)

*transducers*,

*and*deterministic one-

*way*automata equipped with a

*finite*number of registers. ... The model of visibly pushdown

*transducers*allows to describe such transformations,

*and*we propose a simple deterministic extension of this model with

*two*-

*way*moves that has the following properties: i) ... A.3 Expressiveness of

*Two*-

*Way*Visibly Pushdown

*Transducers*THEOREM 6. An order-preserving

*transduction*is

*definable*in

*MSO*[nw2w] if,

*and*only if, it is

*definable*by a functional 6 VPT. Proof. ...

##
###
On the Complexity of Infinite Advice Strings

2018
*
International Colloquium on Automata, Languages and Programming
*

Our main results explore the connections between classes of advice automatic structures,

doi:10.4230/lipics.icalp.2018.122
dblp:conf/icalp/Doueneau-Tabot18
fatcat:73yhszegivf5njr53nv3d54jga
*MSO*-*transductions**and**two*-*way**transducers*. ... We investigate in this paper a notion of comparison between infinite*strings*. In a general*way*, if M is a computation model (e.g. ...*Two*-*way**transductions*appear here to be more basic than relations*defined*by one-*way*machines, since they are clearly motivated by logical issues. ...##
###
Formal Methods of Transformations (Dagstuhl Seminar 17142)

2017
*
Dagstuhl Reports
*

The goal of this Dagstuhl seminar was to gather researchers working on the theory

doi:10.4230/dagrep.7.4.23
dblp:journals/dagstuhl-reports/FiliotMS17
fatcat:2kwm6o7h2banfjp5y5nb4wimvm
*and*practice of transformations (also know as*transductions*) of word*and*tree structures, which are realised by*transducers*... This seminar was motivated by recent advances*and*breakthrough results, both in the settings of words*and*trees. ... From*Two*-*way*to One-*way**Finite**State**Transducers*: a Shepherdson's Approach Jean-Marc Talbot . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
« Previous

*Showing results 1 — 15 out of 189 results*