Search results
From MaRDI portal
- 2013-06-06 Paper Unifying Büchi complementation constructions 2013-04-09 Paper What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic 2012-09-25...10 bytes (17 words) - 17:58, 10 April 2026
- Paper https://portal.mardi4nfdi.de/entity/Q5021013 2022-01-11 Paper What's decidable about weighted automata? 2022-01-06 Paper Verification 2021-11-12 Paper...10 bytes (15 words) - 18:46, 10 April 2026
- 2022-10-13 Paper Complement Avoidance in Binary Words 2022-09-20 Paper The First-Order Theory of Binary Overlap-Free Words is Decidable 2022-09-07 Paper...10 bytes (16 words) - 16:45, 10 April 2026
- 2023-06-15 Paper A decidable theory involving addition of differentiable real functions 2023-04-20 Paper Complexity assessments for decidable fragments of Set...10 bytes (15 words) - 21:58, 10 April 2026
- Paper Complementing deterministic tree-walking automata 2010-01-29 Paper Future-Looking Logics on Data Words and Trees 2009-10-16 Paper A Decidable Characterization...10 bytes (13 words) - 00:10, 12 April 2026
- Paper Runtime Verification over Out-of-order Streams 2019-11-22 Paper Algorithms for monitoring real-time properties 2018-06-26 Paper Scalable offline...10 bytes (13 words) - 02:33, 11 April 2026
- of subgroups of a free group: complements and rank 2024-07-03 Paper The pro-supersolvable topology on a free group: deciding denseness 2024-03-14 Paper Topics...10 bytes (15 words) - 17:43, 10 April 2026
- Paper A simple homotopy proximal mapping algorithm for compressive sensing 2019-06-26 Paper A simple algorithm for solving qualitative probabilistic parity...10 bytes (14 words) - 19:05, 10 April 2026
- unification algorithm for the blended case 1999-06-02 Paper Theories of -layered metric temporal structures: expressiveness and decidability 1999-03-30...10 bytes (14 words) - 13:05, 11 April 2026
- Paper https://portal.mardi4nfdi.de/entity/Q3584055 2010-08-18 Paper Algorithmically independent sequences 2010-04-14 Paper https://portal.mardi4nfdi.de/entity/Q5188221...10 bytes (17 words) - 17:43, 10 April 2026
- 2020-11-06 Paper Learning to complement Büchi automata 2020-07-07 Paper Eternally dominating large grids 2019-10-16 Paper Complementing semi-deterministic Büchi...10 bytes (13 words) - 19:05, 10 April 2026
- 2020-08-20 Paper Advice complexity of priority algorithms 2020-06-02 Paper On conceptually simple algorithms for variants of online bipartite matching 2019-12-19...10 bytes (16 words) - 03:35, 11 April 2026
- the homogeneous model theorem 2017-10-10 Paper Coarse reducibility and algorithmic randomness 2017-04-28 Paper Some Questions in Computable Mathematics 2017-04-04...10 bytes (16 words) - 05:10, 11 April 2026
- SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE 2007-03-21 Paper Permutation rewriting and algorithmic verification 2007-02-20 Paper Active context-free...10 bytes (13 words) - 02:34, 11 April 2026
- Publication Type Symmetric encryption algorithms in a polynomial residue number system 2024-07-24 Paper Efficient algorithms for Lempel-Ziv encoding 2022-12-09...10 bytes (15 words) - 17:45, 10 April 2026
- mardi4nfdi.de/entity/Q4166238 1978-01-01 Paper Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables 1978-01-01 Paper https://portal...10 bytes (13 words) - 16:51, 10 April 2026
- and complementation inV∞ 1984-01-01 Paper Decidable subspaces and recursively enumerable subspaces 1984-01-01 Paper The universal complementation property...10 bytes (17 words) - 17:57, 10 April 2026
- maximum degree 2015-02-27 Paper Hadwiger's conjecture is decidable 2015-02-04 Paper A linear-time algorithm to find a separator in a graph excluding a minor 2014-11-18...10 bytes (16 words) - 17:45, 10 April 2026
- by translates of a function: results and open problems 2021-09-20 Paper Deciding multiple tiling by polygons in polynomial time 2021-08-03 Paper How many...10 bytes (17 words) - 19:03, 10 April 2026
- automata 2013-06-24 Paper Unifying Büchi complementation constructions 2013-04-09 Paper Unifying Büchi complementation constructions 2012-09-18 Paper Effective...10 bytes (13 words) - 17:58, 10 April 2026
