Mandel, A., Simon, I.: On finite semigroups of matrices. Lindenmayer, A.: Mathematical models for cellular interaction in development. Honkala, J.: A short solution for the HDT0L sequence equivalence problem. Griffiths, T.V.: The unsolvability of the equivalence problem for lambda-free nondeterministic generalized machines. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)įiliot, E., Reynier, P.-A.: Transducers, logic and algebra for functions of finite words. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014. 100(5), 206–212 (2006)įiliot, E., Krishna, S.N., Trivedi, A.: First-order definable string transformations. 154(1), 34–91 (1999)Įngelfriet, J., Maneth, S.: The equivalence problem for deterministic MSO tree transducers is decidable. Logic 2, 216–254 (2001)Įngelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. doi: 10.1007/978-2-7_11Įngelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM (2016)ĭartois, L., Jecker, I., Reynier, P.-A.: Aperiodic string transducers. In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016, pp. 47(3), 71–84 (1986)ĭartois, L., Filiot, E., Reynier, P.-A., Talbot, J.-M.: Two-way visibly pushdown automata and transducers. ACM (2017, to appear)Ĭulik, K., Karhumäki, J.: The equivalence of finite valued transducers (on HDT0L languages) is decidable. In: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017. IEEE (2012)īenedikt, M., Duff, T., Sharad, A., Worrell, J.: Polynomial automata: zeroness and applications. doi: 10.1007/978-2-8_1Īlur, R., Filiot, E., Trivedi, A.: Regular transformations of infinite strings. IEEE Computer Society (2013)Īlur, R., Deshmukh, J.V.: Nondeterministic streaming string transducers. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, pp. doi: 10.1007/978-5-5_8Īlur, R., D’Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. 1–12 (2010)Īlur, R., D’Antoni, L.: Streaming tree transducers. 599–610 (2011)Īlur, R., Černý, P.: Expressiveness of streaming string transducers. The functionality of non-deterministic copyful SST is decidable,ĭetermining whether a deterministic copyful SST can be transformed into an equivalent deterministic copyless SST is decidable in polynomial time.Īlur, A., Černý, P.: Streaming transducers for algorithmic verification of single-pass list-processing programs. As a consequence, equivalence of deterministic SST is decidable, The equivalence problem for deterministic copyful SST and the equivalence problem for HDT0L systems are inter-reducible, in linear time. HDT0L systems and total deterministic copyful SST have the same expressive power, In this paper, we propose a semantics of HDT0L systems in terms of transductions, and use it to study the class of deterministic copyful SST. On the other hand, HDT0L systems have been introduced for a while, the most prominent result being the decidability of the equivalence problem. Most notably, they have decidable equivalence problem (in PSpace). It is known that copyless SST capture exactly the class of MSO-definable string-to-string transductions, and are as expressive as deterministic two-way transducers. Copyless SST extend deterministic finite state automata with a set of variables in which to store intermediate output strings, and those variables can be combined and updated all along the run, in a linear manner, i.e., no variable content can be copied on transitions. 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.
0 Comments
Leave a Reply. |