Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Laureline Pinault"'
Autor:
Sasha Rubin, Emmanuel Filiot, Aniello Murano, Sophie Pinchinat, Olivier Serre, Shibashis Guha, Bastien Maubert, Nathanaël Fijalkow, Laureline Pinault, Raphaël Berthon
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, 2021, 22 (1), pp.1-24. ⟨10.1145/3431860⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 22 (1), ⟨10.1007/s00037-021-00214-1⟩
ACM Transactions on Computational Logic, 2020, 22 (1), ⟨10.1145/3431860⟩
ACM Transactions on Computational Logic, 2021, 22 (1), pp.1-24. ⟨10.1145/3431860⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 22 (1), ⟨10.1007/s00037-021-00214-1⟩
ACM Transactions on Computational Logic, 2020, 22 (1), ⟨10.1145/3431860⟩
We study alternating automata with qualitative semantics over infinite binary trees: Alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative semantics says that a run of the automaton is
Publikováno v:
Fundamenta Informaticae
Fundamenta Informaticae, 2021, 180 (4), pp.351-373. ⟨10.3233/FI-2021-2046⟩
Developments in Language Theory
Developments in Language Theory, Aug 2019, Varsovie, Poland
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2021, 180 (4), pp.351-373. ⟨10.3233/FI-2021-2046⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Developments in Language Theory
Developments in Language Theory ISBN: 9783030248857
DLT
Fundamenta Informaticae, 2021, 180 (4), pp.351-373. ⟨10.3233/FI-2021-2046⟩
Developments in Language Theory
Developments in Language Theory, Aug 2019, Varsovie, Poland
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2021, 180 (4), pp.351-373. ⟨10.3233/FI-2021-2046⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Developments in Language Theory
Developments in Language Theory ISBN: 9783030248857
DLT
International audience; We propose a new algorithm for checking language equivalence of non-deterministic Büchi automata. We start from a construction proposed by Calbrix, Nivat and Podelski, which makes it possible to reduce the problem to that of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20d5d1cf15b780c612cf41d08d7a6bac
https://hal.science/hal-03364935
https://hal.science/hal-03364935
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, 2021, ⟨10.1145/3434282⟩
Proceedings of the ACM on Programming Languages, ACM, 2021, ⟨10.1145/3434282⟩
Proceedings of the ACM on Programming Languages, 2021, ⟨10.1145/3434282⟩
Proceedings of the ACM on Programming Languages, ACM, 2021, ⟨10.1145/3434282⟩
We study a cyclic proof system C over regular expression types, inspired by linear logic and non-wellfounded proof theory. Proofs in C can be seen as strongly typed goto programs. We show that they denote computable total functions and we analyse the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ee503eb25154aceeb98b2074e110f26
https://hal.science/hal-02487175
https://hal.science/hal-02487175