Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Bergsträßer, Pascal"'
Formal language theory has recently been successfully employed to unravel the power of transformer encoders. This setting is primarily applicable in Natural Languange Processing (NLP), as a token embedding function (where a bounded number of tokens i
Externí odkaz:
http://arxiv.org/abs/2405.16166
We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by some formulas. The extended framework is known to have applications in provi
Externí odkaz:
http://arxiv.org/abs/2311.04031
Autor:
Bergsträßer, Pascal, Ganardi, Moses
We revisit the membership problem for subclasses of rational relations over finite and infinite words: Given a relation R in a class C_2, does R belong to a smaller class C_1? The subclasses of rational relations that we consider are formed by the de
Externí odkaz:
http://arxiv.org/abs/2304.11034
Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the "directed versio
Externí odkaz:
http://arxiv.org/abs/2205.09015
The knapsack problem for groups was introduced by Miasnikov, Nikolaev, and Ushakov. It is defined for each finitely generated group $G$ and takes as input group elements $g_1,\ldots,g_n,g\in G$ and asks whether there are $x_1,\ldots,x_n\ge 0$ with $g
Externí odkaz:
http://arxiv.org/abs/2101.06132