A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Regular Transformations of Infinite Strings
2012
2012 27th Annual IEEE Symposium on Logic in Computer Science
The theory of regular transformations of finite strings is quite mature with appealing properties. This class can be equivalently defined using both logic (Monadic secondorder logic) and finite-state machines (two-way transducers, and more recently, streaming string transducers); is closed under operations such as sequential composition and regular choice; and problems such as functional equivalence and type checking, are decidable for this class. In this paper, we initiate a study of
doi:10.1109/lics.2012.18
dblp:conf/lics/AlurFT12
fatcat:c4uu62eylfhhha2vb4qjsskfsm