Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJames Worrell 0001
James B. Worrell
Person information
- affiliation: University of Oxford, Department of Computer Science, UK
Other persons with the same name
- James Worrell 0002 (aka: James L. Worrell) — University of Alabama at Birmingham, Department of Accounting and Finance, AL, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j39]Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Deciding ω-regular properties on linear recurrence sequences. Proc. ACM Program. Lang. 5(POPL): 1-24 (2021)- 2020
- [j38]Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell
:
Effective definability of the reachability relation in timed automata. Inf. Process. Lett. 153 (2020) - [c114]Eike Neumann, Joël Ouaknine, James Worrell:
On Ranking Function Synthesis and Termination for Polynomial Programs. CONCUR 2020: 15:1-15:15 - [c113]Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell:
Algebraic Invariants for Linear Hybrid Automata. CONCUR 2020: 32:1-32:17 - [c112]Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. CONCUR 2020: 38:1-38:20 - [c111]Shaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell:
Invariants for Continuous Linear Dynamical Systems. ICALP 2020: 107:1-107:15 - [c110]George Kenison, Richard Lipton, Joël Ouaknine, James Worrell:
On the skolem problem and prime powers. ISSAC 2020: 289-296 - [c109]Toghrul Karimov, Joël Ouaknine, James Worrell:
On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. MFCS 2020: 54:1-54:14 - [c108]Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell:
How Fast Can You Escape a Compact Polytope? STACS 2020: 49:1-49:11 - [c107]Catalin-Andrei Ilie, James B. Worrell:
Parametric Model Checking Continuous-Time Markov Chains. TIME 2020: 7:1-7:18 - [i56]Shaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell:
Invariants for Continuous Linear Dynamical Systems. CoRR abs/2004.11661 (2020) - [i55]George Kenison, Richard Lipton, Joël Ouaknine, James Worrell:
On the Skolem Problem and Prime Powers. CoRR abs/2006.07432 (2020) - [i54]Toghrul Karimov, Joël Ouaknine, James Worrell:
On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. CoRR abs/2007.02911 (2020) - [i53]George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, James Worrell:
On Positivity and Minimality for Second-Order Holonomic Sequences. CoRR abs/2007.12282 (2020) - [i52]Nikhil Balaji, Sylvain Perifel, Mahsa Shirmohammadi, James Worrell:
Cyclotomic Identity Testing and Applications. CoRR abs/2007.13179 (2020) - [i51]Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Deciding ω-Regular Properties on Linear Recurrence Sequences. CoRR abs/2010.14432 (2020)
2010 – 2019
- 2019
- [j37]Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
On the Decidability of Membership in Matrix-exponential Semigroups. J. ACM 66(3): 15:1-15:24 (2019) - [j36]Hsi-Ming Ho, Joël Ouaknine, James Worrell:
On the Expressiveness and Monitoring of Metric Temporal Logic. Log. Methods Comput. Sci. 15(2) (2019) - [j35]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. 63(5): 1027-1048 (2019) - [c106]Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
On the decidability of reachability in linear time-invariant systems. HSCC 2019: 77-86 - [c105]Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell:
On Reachability Problems for Low-Dimensional Matrix Semigroups. ICALP 2019: 44:1-44:15 - [c104]Mehran Hosseini, Joël Ouaknine, James Worrell:
Termination of Linear Loops over the Integers. ICALP 2019: 118:1-118:13 - [c103]Florent Guépin, Christoph Haase, James Worrell:
On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields. LICS 2019: 1-10 - [c102]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
On the Hardness of Robust Classification. NeurIPS 2019: 7444-7453 - [c101]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
On the Monniaux Problem in Abstract Interpretation. SAS 2019: 162-180 - [c100]Shaull Almagor, Joël Ouaknine, James Worrell:
The Semialgebraic Orbit Problem. STACS 2019: 6:1-6:15 - [i50]Shaull Almagor, Joël Ouaknine, James Worrell:
The Semialgebraic Orbit Problem. CoRR abs/1901.11023 (2019) - [i49]Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. CoRR abs/1902.06576 (2019) - [i48]Mehran Hosseini, Joël Ouaknine, James Worrell:
On Termination of Integer Linear Loops. CoRR abs/1902.07465 (2019) - [i47]Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell:
On reachability problems for low dimensional matrix semigroups. CoRR abs/1902.09597 (2019) - [i46]Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell:
Algebraic Invariants for Linear Hybrid Automata. CoRR abs/1902.10452 (2019) - [i45]Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Effective Definability of the Reachability Relation in Timed Automata. CoRR abs/1903.09773 (2019) - [i44]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
On the Monniaux Problem in Abstract Interpretation. CoRR abs/1907.08257 (2019) - [i43]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
On the Hardness of Robust Classification. CoRR abs/1909.05822 (2019) - [i42]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
On the Hardness of Robust Classification. Electron. Colloquium Comput. Complex. 26: 123 (2019) - 2018
- [j34]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. Log. Methods Comput. Sci. 14(4) (2018) - [j33]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. Log. Methods Comput. Sci. 14(4) (2018) - [j32]Joël Ouaknine, Igor Potapov, James Worrell:
Reachability Problems 2014: Special issue. Theor. Comput. Sci. 735: 1 (2018) - [c99]Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine, James Worrell:
Effective Divergence Analysis for Linear Recurrence Sequences. CONCUR 2018: 42:1-42:15 - [c98]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Linear Loops. ICALP 2018: 114:1-114:14 - [c97]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When is Containment Decidable for Probabilistic Automata?. ICALP 2018: 121:1-121:14 - [c96]Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell:
Costs and Rewards in Priced Timed Automata. ICALP 2018: 125:1-125:14 - [c95]Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell:
Polynomial Invariants for Affine Programs. LICS 2018: 530-539 - [p2]Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Joël Ouaknine, James Worrell:
Model Checking Real-Time Systems. Handbook of Model Checking 2018: 1001-1046 - [e2]Igor Potapov, Paul G. Spirakis, James Worrell:
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. LIPIcs 117, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-086-6 [contents] - [i41]Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell:
Polynomial Invariants for Affine Programs. CoRR abs/1802.01810 (2018) - [i40]Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
On the Decidability of Reachability in Linear Time-Invariant Systems. CoRR abs/1802.06575 (2018) - [i39]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Linear Loops. CoRR abs/1802.09263 (2018) - [i38]Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell:
Costs and Rewards in Priced Timed Automata. CoRR abs/1803.01914 (2018) - [i37]Hsi-Ming Ho, Joël Ouaknine, James Worrell:
On the Expressiveness and Monitoring of Metric Temporal Logic. CoRR abs/1803.02653 (2018) - [i36]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When is Containment Decidable for Probabilistic Automata? CoRR abs/1804.09077 (2018) - [i35]Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine, James Worrell:
Effective Divergence Analysis for Linear Recurrence Sequences. CoRR abs/1806.07740 (2018) - 2017
- [j31]Stefan Kiefer, Ines Marusic, James Worrell:
Minimisation of Multiplicity Tree Automata. Log. Methods Comput. Sci. 13(1) (2017) - [j30]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. SIAM J. Appl. Algebra Geom. 1(1): 285-307 (2017) - [c94]Patricia Bouyer, François Laroussinie, Nicolas Markey, Joël Ouaknine, James Worrell:
Timed Temporal Logics. Models, Algorithms, Logics and Tools 2017: 211-230 - [c93]Nathanaël Fijalkow, Cristian Riveros, James Worrell:
Probabilistic Automata of Bounded Ambiguity. CONCUR 2017: 19:1-19:14 - [c92]Joël Ouaknine, João Sousa Pinto, James Worrell:
On the Polytope Escape Problem for Continuous Linear Dynamical Systems. HSCC 2017: 11-17 - [c91]Shaull Almagor, Joël Ouaknine, James Worrell:
The Polytope-Collision Problem. ICALP 2017: 24:1-24:14 - [c90]James Worrell:
The Zero Problem for Exponential Polynomials. ISSAC 2017: 5 - [c89]Michael Benedikt, Timothy Duff, Aditya Sharad, James Worrell:
Polynomial automata: Zeroness and applications. LICS 2017: 1-12 - [c88]Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Revisiting reachability in timed automata. LICS 2017: 1-12 - [c87]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Rationality of Nonnegative Matrix Factorization. SODA 2017: 1290-1305 - [c86]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS 2017: 29:1-29:13 - [i34]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR abs/1701.02162 (2017) - [i33]Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Revisiting Reachability in Timed Automata. CoRR abs/1702.03450 (2017) - [i32]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. CoRR abs/1711.06120 (2017) - 2016
- [j29]Christoph Haase, Joël Ouaknine, James Worrell:
Relating Reachability Problems in Timed and Counter Automata. Fundam. Informaticae 143(3-4): 317-338 (2016) - [j28]Ventsislav Chonev, Joël Ouaknine, James Worrell:
On the Complexity of the Orbit Problem. J. ACM 63(3): 23:1-23:18 (2016) - [j27]Ranko Lazic, Joël Ouaknine, James Worrell:
Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete. ACM Trans. Comput. Log. 17(3): 16:1-16:27 (2016) - [j26]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ACM Trans. Comput. Log. 17(4): 32:1-32:38 (2016) - [c85]Christel Baier, Stefan Kiefer, Joachim Klein, Sascha Klüppelholz, David Müller, James Worrell:
Markov Chains and Unambiguous Büchi Automata. CAV (1) 2016: 23-42 - [c84]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. CONCUR 2016: 29:1-29:14 - [c83]Ventsislav Chonev, Joël Ouaknine, James Worrell:
On the Skolem Problem for Continuous Linear Dynamical Systems. ICALP 2016: 100:1-100:13 - [c82]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Restricted Nonnegative Matrix Factorization. ICALP 2016: 103:1-103:14 - [c81]Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, James Worrell:
Proving the Herman-Protocol Conjecture. ICALP 2016: 104:1-104:12 - [c80]Ventsislav Chonev, Joël Ouaknine, James Worrell:
On Recurrent Reachability for Continuous Linear Dynamical Systems. LICS 2016: 515-524 - [c79]Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
Solvability of Matrix-Exponential Equations. LICS 2016: 798-806 - [i31]Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
Solvability of Matrix-Exponential Equations. CoRR abs/1601.05002 (2016) - [i30]Christel Baier, Stefan Kiefer, Joachim Klein, Sascha Klüppelholz, David Müller, James Worrell:
Markov Chains and Unambiguous Büchi Automata. CoRR abs/1605.00950 (2016) - [i29]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. CoRR abs/1605.06848 (2016) - [i28]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Restricted Nonnegative Matrix Factorization. CoRR abs/1605.07061 (2016) - [i27]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. CoRR abs/1606.02643 (2016) - [i26]Shaull Almagor, Joël Ouaknine, James Worrell:
The Polytope-Collision Problem. CoRR abs/1611.01344 (2016) - 2015
- [j25]S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell:
Reachability problems for Markov chains. Inf. Process. Lett. 115(2): 155-158 (2015) - [j24]Ines Marusic, James Worrell:
Complexity of equivalence and learning for multiplicity tree automata. J. Mach. Learn. Res. 16: 2465-2500 (2015) - [j23]Joël Ouaknine, James Worrell:
On linear recurrence sequences and loop termination. ACM SIGLOG News 2(2): 4-13 (2015) - [c78]James Worrell:
Reachability Problems for Continuous Linear Dynamical Systems (Invited Paper). CONCUR 2015: 17-17 - [c77]Stefan Kiefer, Ines Marusic, James Worrell:
Minimisation of Multiplicity Tree Automata. FoSSaCS 2015: 297-311 - [c76]Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell:
Three Variables Suffice for Real-Time Logic. FoSSaCS 2015: 361-374 - [c75]James Worrell:
Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk). FSTTCS 2015: 5-6 - [c74]Antonia Lechner, Joël Ouaknine, James Worrell:
On the Complexity of Linear Arithmetic with Divisibility. LICS 2015: 667-676 - [c73]Ventsislav Chonev, Joël Ouaknine, James Worrell:
The Polyhedron-Hitting Problem. SODA 2015: 940-956 - [c72]Joël Ouaknine, João Sousa Pinto, James Worrell:
On Termination of Integer Linear Loops. SODA 2015: 957-969 - [c71]Esther Galby, Joël Ouaknine, James Worrell:
On Matrix Powering in Low Dimensions. STACS 2015: 329-340 - [i25]Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, James Worrell:
Proving the Herman-Protocol Conjecture. CoRR abs/1504.01130 (2015) - [i24]Ventsislav Chonev, Joël Ouaknine, James Worrell:
On the Decidability of the Bounded Continuous Skolem Problem. CoRR abs/1506.00695 (2015) - [i23]Joël Ouaknine, João Sousa Pinto, James Worrell:
The Polyhedral Escape Problem is Decidable. CoRR abs/1507.03166 (2015) - [i22]Ventsislav Chonev, Joël Ouaknine, James Worrell:
On the Decidability of the Continuous Infinite Zeros Problem. CoRR abs/1507.03632 (2015) - 2014
- [j22]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Language equivalence of probabilistic pushdown automata. Inf. Comput. 237: 1-11 (2014) - [c70]Franck van Breugel, James Worrell:
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata. Horizons of the Mind 2014: 191-213 - [c69]Joël Ouaknine, James Worrell:
On the Positivity Problem for Simple Linear Recurrence Sequences, . ICALP (2) 2014: 318-329 - [c68]Joël Ouaknine, James Worrell:
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences. ICALP (2) 2014: 330-341 - [c67]Ines Marusic, James Worrell:
Complexity of Equivalence and Learning for Multiplicity Tree Automata. MFCS (1) 2014: 414-425 - [c66]Hsi-Ming Ho, Joël Ouaknine, James Worrell:
Online Monitoring of Metric Temporal Logic. RV 2014: 178-192 - [c65]Joël Ouaknine, James Worrell:
Positivity Problems for Low-Order Linear Recurrence Sequences. SODA 2014: 366-379 - [e1]Joël Ouaknine, Igor Potapov, James Worrell:
Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. Lecture Notes in Computer Science 8762, Springer 2014, ISBN 978-3-319-11438-5 [contents] - [i21]Ines Marusic, James Worrell:
Complexity of Equivalence and Learning for Multiplicity Tree Automata. CoRR abs/1405.0514 (2014) - [i20]Michael Benedikt, Rastislav Lenhardt, James Worrell:
Model Checking Markov Chains Against Unambiguous Buchi Automata. CoRR abs/1405.4560 (2014) - [i19]Ventsislav Chonev, Joël Ouaknine, James Worrell:
The Polyhedron-Hitting Problem. CoRR abs/1407.1889 (2014) - [i18]Joël Ouaknine, João Sousa Pinto, James Worrell:
On Termination of Integer Linear Loops. CoRR abs/1407.1891 (2014) - [i17]Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell:
Three Variables are Enough for Real-Time Specification. CoRR abs/1408.1851 (2014) - 2013
- [j21]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
On the Complexity of Equivalence and Minimisation for Q-weighted Automata. Log. Methods Comput. Sci. 9(1) (2013) - [j20]Michael Benedikt, Rastislav Lenhardt, James Worrell:
Two Variable vs. Linear Temporal Logic in Model Checking and Games. Log. Methods Comput. Sci. 9(2) (2013) - [j19]Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell:
A Static Analysis Framework for Livelock Freedom in CSP. Log. Methods Comput. Sci. 9(3) (2013) - [j18]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
Algorithmic probabilistic game semantics - Playing games with automata. Formal Methods Syst. Des. 43(2): 285-312 (2013) - [j17]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell:
Addendum to "Recursively defined metric spaces without contraction" [TCS 380 (1/2) (2007) 143-163]. Theor. Comput. Sci. 492: 117-122 (2013) - [c64]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. ATVA 2013: 55-70 - [c63]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ICALP (2) 2013: 74-88 - [c62]James Worrell:
Revisiting the Equivalence Problem for Finite Multitape Automata. ICALP (2) 2013: 422-433 - [c61]Paul Hunter, Joël Ouaknine, James Worrell:
Expressive Completeness for Metric Temporal Logic. LICS 2013: 349-357 - [c60]Ranko Lazic, Joël Ouaknine, James Worrell:
Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian. MFCS 2013: 643-654 - [c59]Ventsislav Chonev, Joël Ouaknine, James Worrell:
The orbit problem in higher dimensions. STOC 2013: 941-950 - [c58]Michael Benedikt, Rastislav Lenhardt, James Worrell:
LTL Model Checking of Interval Markov Chains. TACAS 2013: 32-46 - [i16]Ventsislav Chonev, Joël Ouaknine, James Worrell:
The Orbit Problem in Higher Dimensions. CoRR abs/1303.2981 (2013) - [i15]James Worrell:
On the Complexity of Multitape Automata Equivalence. CoRR abs/1303.6704 (2013) - [i14]Saguy Benaim, Michael Benedikt, Rastislav Lenhardt, James Worrell:
Controlling the Depth, Size, and Number of Subtrees for Two-variable Logic on Trees. CoRR abs/1304.6925 (2013) - [i13]Joël Ouaknine, James Worrell:
Positivity Problems for Low-Order Linear Recurrence Sequences. CoRR abs/1307.2779 (2013) - [i12]Joël Ouaknine, James Worrell:
Effective Positivity Problems for Simple Linear Recurrence Sequences. CoRR abs/1309.1550 (2013) - [i11]Joël Ouaknine, James Worrell:
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences. CoRR abs/1309.1914 (2013) - 2012
- [j16]Patricia Bouyer, Nicolas Markey,