The following pages link to Paul C. Bell (Q338383):
Displayed 40 items.
- On the decidability and complexity of problems for restricted hierarchical hybrid systems (Q338386) (← links)
- The continuous Skolem-Pisot problem (Q708215) (← links)
- Item:Q338383 (redirect page) (← links)
- On the membership of invertible diagonal and scalar matrices (Q870838) (← links)
- Reachability problems in quaternion matrix and rotation semigroups (Q958311) (← links)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
- Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
- On injectivity of quantum finite automata (Q2229947) (← links)
- Freeness properties of weighted and probabilistic automata over bounded languages (Q2280319) (← links)
- Unique decipherability in formal languages (Q2283038) (← links)
- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines (Q2343996) (← links)
- On undecidability bounds for matrix decision problems (Q2474220) (← links)
- Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages (Q2798744) (← links)
- (Q2893294) (← links)
- Mortality for 2 ×2 Matrices Is NP-Hard (Q2912716) (← links)
- Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines (Q3010382) (← links)
- ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (Q3069735) (← links)
- Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives (Q3447693) (← links)
- Factorization in Formal Languages (Q3451092) (← links)
- Reachability Problems in Quaternion Matrix and Rotation Semigroups (Q3525582) (← links)
- On the Joint Spectral Radius for Bounded Matrix Languages (Q3584963) (← links)
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM (Q3601323) (← links)
- Lowering Undecidability Bounds for Decision Questions in Matrices (Q3617076) (← links)
- The Identity Correspondence Problem and Its Applications (Q3652252) (← links)
- The Identity Problem for Matrix Semigroups in SL<sub>2</sub>(ℤ) is <b>NP</b>-complete (Q4575748) (← links)
- Decision Problems for Probabilistic Finite Automata on Bounded Languages (Q4914308) (← links)
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (Q5089287) (← links)
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
- Acceptance Ambiguity for Quantum Automata (Q5092433) (← links)
- On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond (Q5092447) (← links)
- Reachability Problems for Hierarchical Piecewise Constant Derivative Systems (Q5168512) (← links)
- (Q5422263) (← links)
- Periodic and Infinite Traces in Matrix Semigroups (Q5448643) (← links)
- Developments in Language Theory (Q5473667) (← links)
- Towards uniform online spherical tessellations (Q5918678) (← links)
- Towards uniform online spherical tessellations (Q5918814) (← links)
- Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871) (← links)
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete (Q6178465) (← links)
- The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations (Q6210869) (← links)
- On the Identity and Group Problems for Complex Heisenberg Matrices (Q6443326) (← links)