Zobrazeno 1 - 10
of 1 254
pro vyhledávání: '"BELL, PAUL A."'
We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by Blondel and Megr
Externí odkaz:
http://arxiv.org/abs/2307.05283
Autor:
Townsend, Dominique, Leyland, Julian, Kassem, Hachem, Thompson, Charlie E.L., Townend, Ian H., Bell, Paul S., Bird, Cai O.
Publikováno v:
In Geomorphology 15 January 2025 469
Autor:
Bell, Paul C., Semukhin, Pavel
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (December 21, 2023) lmcs:9753
We study the emptiness and $\lambda$-reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degree of ambiguity of the automaton and the size of its alphabet. O
Externí odkaz:
http://arxiv.org/abs/2105.10293
Publikováno v:
In Information and Computation January 2024 296
Autor:
Bell, Paul C., Semukhin, Pavel
We show the surprising result that the cutpoint isolation problem is decidable for Probabilistic Finite Automata (PFA) where input words are taken from a letter-bounded context-free language. A context-free language $\mathcal{L}$ is letter-bounded wh
Externí odkaz:
http://arxiv.org/abs/2002.07660
Autor:
Bell, Paul C., Hirvensalo, Mika
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Measure Once Quantum Finite Automata (MO-QFA). We study the injectivity problem of determining if the acceptance probability function of a MO-QFA is inj
Externí odkaz:
http://arxiv.org/abs/1907.01471
We consider the following variant of the Mortality Problem: given $k\times k$ matrices $A_1, A_2, \dots,A_{t}$, does there exist nonnegative integers $m_1, m_2, \dots,m_t$ such that the product $A_1^{m_1} A_2^{m_2} \cdots A_{t}^{m_{t}}$ is equal to t
Externí odkaz:
http://arxiv.org/abs/1902.10188
Autor:
Bell, Paul C.
We consider the computability and complexity of decision questions for Probabilistic Finite Automata (PFA) with sub-exponential ambiguity. We show that the emptiness problem for strict and non-strict cut-points of polynomially ambiguous commutative P
Externí odkaz:
http://arxiv.org/abs/1902.09407
Autor:
Bell, Paul C., Potapov, Igor
The problem of uniformly placing N points onto a sphere finds applications in many areas. For example, points on the sphere correspond to unit quaternions as well as to the group of rotations SO(3) and the online version of generating uniform rotatio
Externí odkaz:
http://arxiv.org/abs/1810.01786
Autor:
Bell, Paul C.
Publikováno v:
In Journal of Computer and System Sciences August 2022 127:53-65