{"id":12,"date":"2023-12-08T17:44:38","date_gmt":"2023-12-08T17:44:38","guid":{"rendered":"https:\/\/dlt2019.mimuw.edu.pl\/?page_id=12"},"modified":"2023-12-08T17:47:39","modified_gmt":"2023-12-08T17:47:39","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/dlt2019.mimuw.edu.pl\/conference\/accepted-papers\/","title":{"rendered":"Accepted papers"},"content":{"rendered":"\n
\n
\n \t
\n \nViliam Geffert, Zuzana Bednarova and Alexander Szabari<\/span>\n<\/span><\/dt>\n \t
\n Input-Driven Pushdown Automata for Edit Distance Neighborhood<\/span><\/dd>\n \t
\n \n\nMarie Lejeune<\/a>, Julien Leroy and Michel Rigo\n\n<\/span><\/span><\/dt>\n \t
\n Computing the k-binomial complexity of the Thue-Morse word<\/span><\/dd>\n \t
\n \nPaolo Massazza<\/a>\n<\/span><\/dt>\n \t
\n Hole-free Partially Directed Animals<\/span><\/dd>\n \t
\n \n\nUmer Azfar, Costanza Catalano<\/a>, Ludovic Charlier and Rapha\u00ebl Jungers<\/a>\n<\/span>\n<\/span><\/dt>\n \t
\n A linear bound on the k-rendezvous time for primitive sets of NZ matrices<\/span><\/dd>\n \t
\n \n\nMassimiliano Goldwurm<\/a>, Jianyi Lin<\/a>\nand Marco Vignati<\/a>\n<\/span>\n<\/span><\/dt>\n \t
\n Analysis of symbol statistics in bicomponent rational models<\/span><\/dd>\n \t
\n \n\nDenis Kuperberg<\/a>, Laureline Pinault and Damien Pous<\/a>\n<\/span>\n<\/span><\/dt>\n \t
\n Coinductive algorithms for B\u00fcchi automata<\/span><\/dd>\n \t
\n \n\nSimon Iosti and Denis Kuperberg<\/a>\n<\/span>\n<\/span><\/dt>\n \t
\n Eventually Safe Languages<\/span><\/dd>\n \t
\n \nAleksi Saarela<\/a>\n<\/span><\/dt>\n \t
\n Separating many words by counting occurrences of factors<\/span><\/dd>\n \t
\n \n\nEgor Dobronravov, Nikita Dobronravov and Alexander Okhotin<\/a>\n<\/span>\n<\/span><\/dt>\n \t
\n On the length of shortest strings accepted by two-way finite automata<\/span><\/dd>\n \t
\n \n\nDi-De Yen and Hsu-Chun Yen<\/a>\n<\/span>\n<\/span><\/dt>\n \t
\n Characterizing the Valuedness of Two-way Finite Transducers<\/span><\/dd>\n \t
\n \n\nJoel Day, Pamela Fleischmann, Florin Manea<\/a>\nand Dirk Nowotka\n\n<\/span><\/span><\/dt>\n \t
\n k-Spectra of c-Balanced Words<\/span><\/dd>\n \t
\n \nTara Brough, Alan Cain and Markus Pfeiffer<\/span>\n<\/span><\/dt>\n \t
\n Context-free word problem semigroups<\/span><\/dd>\n \t
\n \n\nFriedrich Otto and Franti\u0161ek Mr\u00e1z<\/a>\n<\/span>\n<\/span><\/dt>\n \t
\n On Shrinking Restarting Automata of Window Size One and Two<\/span><\/dd>\n \t
\n \nJarkko Kari, Andrew Ryzhikov and Anton Varonka<\/span>\n<\/span><\/dt>\n \t
\n Words of Minimum Rank in Deterministic Finite Automata<\/span><\/dd>\n \t
\n \nPaul Gastin, Amaldev Manuel and Govind R<\/span>\n<\/span><\/dt>\n \t
\n Logics for Reversible Regular Languages and Semigroups with Involution<\/span><\/dd>\n \t
\n \nAnna Frid<\/a>\n<\/span><\/dt>\n \t
\n First lower bounds on palindromic length<\/span><\/dd>\n \t
\n \n\nHyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko<\/a>\nand Kai Salomaa\n\n<\/span><\/span><\/dt>\n \t
\n The Relative Edit-Distance Between Two Input-Driven Languages<\/span><\/dd>\n \t
\n \nPetr Ambroz and Edita Pelantov\u00e1<\/span>\n<\/span><\/dt>\n \t
\n On palindromic length of Sturmian sequences<\/span><\/dd>\n \t
\n Ziyuan Gao. <\/span><\/dt>\n \t
\n The Teaching Complexity of Erasing Pattern Languages With Bounded Variable Frequency<\/span><\/dd>\n \t
\n \n\nRamchandra Phawade<\/a>, Krishna S<\/a>, Ashutosh Trivedi<\/a>\nand Devendra Bhave\n\n<\/span><\/span><\/dt>\n \t
\n On timed scope-bounded context-sensitive languages<\/span><\/dd>\n<\/dl>\n<\/div>\n","protected":false},"excerpt":{"rendered":"Viliam Geffert, Zuzana Bednarova and Alexander Szabari Input-Driven Pushdown Automata for Edit Distance Neighborhood Marie Lejeune, Julien Leroy and Michel Rigo Computing the k-binomial complexity of the Thue-Morse word Paolo Massazza Hole-free Partially Directed Animals Umer Azfar, Costanza Catalano, Ludovic Charlier and Rapha\u00ebl Jungers A linear bound on the k-rendezvous time for primitive sets of […]","protected":false},"author":1,"featured_media":0,"parent":10,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/dlt2019.mimuw.edu.pl\/wp-json\/wp\/v2\/pages\/12"}],"collection":[{"href":"https:\/\/dlt2019.mimuw.edu.pl\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/dlt2019.mimuw.edu.pl\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/dlt2019.mimuw.edu.pl\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dlt2019.mimuw.edu.pl\/wp-json\/wp\/v2\/comments?post=12"}],"version-history":[{"count":1,"href":"https:\/\/dlt2019.mimuw.edu.pl\/wp-json\/wp\/v2\/pages\/12\/revisions"}],"predecessor-version":[{"id":13,"href":"https:\/\/dlt2019.mimuw.edu.pl\/wp-json\/wp\/v2\/pages\/12\/revisions\/13"}],"up":[{"embeddable":true,"href":"https:\/\/dlt2019.mimuw.edu.pl\/wp-json\/wp\/v2\/pages\/10"}],"wp:attachment":[{"href":"https:\/\/dlt2019.mimuw.edu.pl\/wp-json\/wp\/v2\/media?parent=12"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}