{"id":92,"date":"2024-01-16T11:08:02","date_gmt":"2024-01-16T10:08:02","guid":{"rendered":"https:\/\/project.inria.fr\/daal2024\/?page_id=92"},"modified":"2024-03-07T14:37:30","modified_gmt":"2024-03-07T13:37:30","slug":"invited-speaker","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/daal2024\/en\/invited-speaker\/","title":{"rendered":"Invited Speakers"},"content":{"rendered":"
<\/th><\/th><\/tr><\/thead>
Philippe Schnoebelen<\/strong><\/td>Laure Daviaud<\/strong><\/td><\/tr>
\"\"<\/td>\"\"<\/td><\/tr>
Philippe schnoebelen<\/a><\/strong> is Directeur de recherche CNRS & Professeur attach\u00e9 ENS Paris-Saclay. <\/td>Laure Daviaud<\/a><\/strong> Lecturer in Computer Science at City University of London.<\/td><\/tr>
<\/td><\/td><\/tr>
Title<\/strong>: Reasoning about subwords and subsequences\u00a0<\/td>Title<\/strong>: Weighted automata: To be decidable, or not to be decidable, that is the question.<\/td><\/tr>

Abstract<\/strong>: \u00a0In language theory, a subsequence of a word is called a subword (or sometimes a scattered subword) and should not be confused with a factor which is a contiguous block of letters extracted from the original word.
Subwords do not behave as nicely as factors and many interesting problems in logic, automata theory, and algorithmics are harder for subwords than for factors. In this talk I shall consider several instances of this phenomenon, present some recent results and offer some open problems.<\/td>

Abstract<\/strong>: In this talk, I will first give a broad overview of decidability problems for weighted automata, what is known, and what is still open. I will then focus on a specific recent result and explain the decision procedure for the Big-O problem for max-plus automata.





<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

<\/p>","protected":false},"excerpt":{"rendered":"

Philippe Schnoebelen Laure Daviaud Philippe schnoebelen is Directeur de recherche CNRS & Professeur attach\u00e9 ENS Paris-Saclay. Laure Daviaud Lecturer in Computer Science at City University of London. Title: Reasoning about subwords and subsequences\u00a0 Title: Weighted automata: To be decidable, or not to be decidable, that is the question. Abstract: \u00a0In\u2026<\/p>\n

Continue reading<\/span><\/i><\/a> <\/p>\n","protected":false},"author":929,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":"","_members_access_role":[],"_members_access_error":""},"class_list":["post-92","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/daal2024\/en\/wp-json\/wp\/v2\/pages\/92","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/daal2024\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/daal2024\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/daal2024\/en\/wp-json\/wp\/v2\/users\/929"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/daal2024\/en\/wp-json\/wp\/v2\/comments?post=92"}],"version-history":[{"count":12,"href":"https:\/\/project.inria.fr\/daal2024\/en\/wp-json\/wp\/v2\/pages\/92\/revisions"}],"predecessor-version":[{"id":288,"href":"https:\/\/project.inria.fr\/daal2024\/en\/wp-json\/wp\/v2\/pages\/92\/revisions\/288"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/daal2024\/en\/wp-json\/wp\/v2\/media?parent=92"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}