Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Theory of computation → Models of computation"'
Publikováno v:
Logical Methods in Computer Science. 19
We study the learnability of symbolic finite state automata (SFA), a model shown useful in many applications in software verification. The state-of-the-art literature on this topic follows the query learning paradigm, and so far all obtained results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b68fbc239ed4dcdecb2c7e7939f179f
https://doi.org/10.46298/lmcs-19(2:5)2023
https://doi.org/10.46298/lmcs-19(2:5)2023
Autor:
Faggian, Claudia
Rewriting is a foundation for the operational theory of programming languages. The process of rewriting describes the computation of a result (typically, a normal form), with lambda-calculus being the paradigmatic example for rewriting as an abstract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fa2396dd3d27b179bd296083bd41c5a
Autor:
Gaboardi, Marco, van Raamsdonk, Femke
LIPIcs, Volume 260, FSCD 2023, Complete Volume
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), pages 1-658
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), pages 1-658
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::603f7fe1e8cc5998c955dbe46fbe587a
https://drops.dagstuhl.de/opus/volltexte/2023/17983/
https://drops.dagstuhl.de/opus/volltexte/2023/17983/
Autor:
Gaboardi, Marco, van Raamsdonk, Femke
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), pages 0:i-0:xviii
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), pages 0:i-0:xviii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66e61de0bd7a314830af6d0477319d2a
Seminal results establish that the coverability problem for Vector Addition Systems with States (VASS) is in EXPSPACE (Rackoff, '78) and is EXPSPACE-hard already under unary encodings (Lipton, '76). More precisely, Rosier and Yen later utilise Rackof
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7062ed8a9062a92933611a8056650d5b
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), pages 0:i-0:xxii
LIPIcs, Vol. 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), pages 0:i-0:xxii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6928c1f84b3222ede6d46f10960cc4b
LIPIcs, Volume 254, STACS 2023, Complete Volume
LIPIcs, Vol. 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), pages 1-1026
LIPIcs, Vol. 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), pages 1-1026
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e39906164f37e472f49fa0508161900f
Publikováno v:
40th International Symposium on Theoretical Aspects of Computer Science
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics
We study the (ω-)regular separability problem for Büchi VASS languages: Given two Büchi VASS with languages L₁ and L₂, check whether there is a regular language that fully contains L₁ while remaining disjoint from L₂. We show that the prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3068979a8304c44b5f07bbffdc88a376
https://hdl.handle.net/21.11116/0000-000C-B71D-621.11116/0000-000C-B71F-4
https://hdl.handle.net/21.11116/0000-000C-B71D-621.11116/0000-000C-B71F-4
Regular nested word languages (a.k.a. visibly pushdown languages) strictly extend regular word languages, while preserving their main closure and decidability properties. Previous works have shown that considering languages of 2-nested words, i.e. wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c38c60bb00b195bfc821c59714e5920
http://arxiv.org/abs/2208.10347
http://arxiv.org/abs/2208.10347
In this paper, we address sorting networks that are constructed from comparators of arity k > 2. I.e., in our setting the arity of the comparators - or, in other words, the number of inputs that can be sorted at the unit cost - is a parameter. We stu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62bcb8449fc213e33a144e2bd900c717
http://arxiv.org/abs/2208.08394
http://arxiv.org/abs/2208.08394