Zobrazeno 1 - 10
of 33 396
pro vyhledávání: '"automata theory"'
Timed automata are a widely used formalism for specifying discrete-state/continuous-time behaviors of time-critical reactive systems. Concerning the fundamental verification problem of comparing a candidate implementation against a specification, bot
Externí odkaz:
http://arxiv.org/abs/2412.15799
Autor:
Zheng, Yangluo
The geometric dimension of a Vector Addition System with States (VASS), emerged in Leroux and Schmitz (2019) and formalized by Fu, Yang, and Zheng (2024), quantifies the dimension of the vector space spanned by cycle effects in the system. This paper
Externí odkaz:
http://arxiv.org/abs/2412.14608
In this work, we prove the NP-completeness of two variants of tokenisation, defined as the problem of compressing a dataset to at most $\delta$ symbols by either finding a vocabulary directly (direct tokenisation), or selecting a sequence of merge op
Externí odkaz:
http://arxiv.org/abs/2412.15210
Industrial control systems (ICSs) increasingly rely on digital technologies vulnerable to cyber attacks. Cyber attackers can infiltrate ICSs and execute malicious actions. Individually, each action seems innocuous. But taken together, they cause the
Externí odkaz:
http://arxiv.org/abs/2412.14467
Population protocols are a model of distributed computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs to decide some property of their initial configuration. We investigate the behaviour of population pro
Externí odkaz:
http://arxiv.org/abs/2412.11783
We study conditions under which transformers using soft attention can simulate hard attention, that is, effectively focus all attention on a subset of positions. First, we examine several variants of linear temporal logic, whose formulas have been pr
Externí odkaz:
http://arxiv.org/abs/2412.09925
This work studies the question of learning probabilistic deterministic automata from language models. For this purpose, it focuses on analyzing the relations defined on algebraic structures over strings by equivalences and similarities on probability
Externí odkaz:
http://arxiv.org/abs/2412.09760
Autor:
Yamakami, Tomoyuki
We discuss a nondeterministic variant of the recently introduced machine model of deterministic auxiliary depth-$k$ storage automata (or aux-$k$-sda's) by Yamakami. It was proven that all languages recognized by polynomial-time logarithmic-space aux-
Externí odkaz:
http://arxiv.org/abs/2412.09186
Autor:
Bishop, Alex, D'Angeli, Daniele, Matucci, Francesco, Nagnibeda, Tatiana, Perego, Davide, Rodaro, Emanuele
We are interested in the generalised word problem (aka subgroup membership problem) for stabiliser subgroups of groups acting on rooted $d$-regular trees. Stabilisers of infinite rays in the tree are not finitely generated in general, and so the prob
Externí odkaz:
http://arxiv.org/abs/2412.08433