- Stéphanie Delaune:
An undecidability result for AGh. Theor. Comput. Sci. 368(1-2): 161-167 (2006) - Maria Paola Bonacina, Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli:
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures. IJCAR 2006: 513-527 - Petr Jancar, Jirí Srba:
Undecidability Results for Bisimilarity on Prefix Rewrite Systems. FoSSaCS 2006: 277-291 - 2002
- David Gamarnik:
Computing stationary probability distributions and large deviation rates for constrained random walks.: the undecidability results. SIGMETRICS Perform. Evaluation Rev. 30(3): 38-40 (2002) - Changwook Kim:
Two undecidability results for chain code picture languages. Theor. Comput. Sci. 270(1-2): 969-976 (2002) - Malte Helmert:
Decidability and Undecidability Results for Planning with Numerical State Variables. AIPS 2002: 44-53 - Malte Helmert:
Decidability and Undecidability Results for Planning with Numerical State Variables. PuK 2002 - 2001
- Michael Wessel:
Obstacles on the Way to Qualitative Spatial Reasoning with Description Logics: Some Undecidability Results. Description Logics 2001 - Vesa Halava, Tero Harju:
An Undecidability Result Concerning Periodic Morphisms. Developments in Language Theory 2001: 304-310 - 2000
- Dietmar Wätjen:
Undecidability Results for Uniformly k-Limited 0L Systems. J. Autom. Lang. Comb. 5(2): 159-167 (2000) - Rodney G. Downey, André Nies:
Undecidability Results for Low Complexity Time Classes. J. Comput. Syst. Sci. 60(2): 465-479 (2000) - Masashi Katsura, Yuji Kobayashi, Friedrich Otto:
Undecidability Results for Monoids with Linear-Time Decidable Word Problems. ISAAC 2000: 278-289 - Juris Hartmanis:
Undecidability and Incompleteness Results in Automata Theory. A Half-Century of Automata Theory 2000: 21-35 - 1999
- Erich Grädel, Martin Otto, Eric Rosen:
Undecidability results on two-variable logics. Arch. Math. Log. 38(4-5): 313-354 (1999) - Jacques Mazoyer, Ivan Rapaport:
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results. Discret. Math. 199(1-3): 103-122 (1999) - Daniel Kirsten:
Some Undecidability Results Related to the Star Problem in Trace Monoids. STACS 1999: 227-236 - 1998
- Maurice Boffa:
More on an Undecidability Result of Bateman, Jockusch and Woods. J. Symb. Log. 63(1): 50 (1998) - Friedrich Otto:
Some Undecidability Results Concerning the Property of Preserving Regularity. Theor. Comput. Sci. 207(1): 43-72 (1998) - James Bailey, Guozhu Dong, Kotagiri Ramamohanarao:
Decidability and Undecidability Results for the Termination Problem of Active Database Rules. PODS 1998: 264-273 - 1997
- Klaus Madlener, Friedrich Otto:
Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. Fundam. Informaticae 30(1): 31-44 (1997) - Rodney G. Downey, André Nies:
Undecidability Results for Low Complexity Degree Structures. CCC 1997: 128-132 - Erich Grädel, Martin Otto, Eric Rosen:
Undecidability Results on Two-Variable Logics. STACS 1997: 249-260 - 1996
- Heike Spilker, Dietmar Wätjen:
Some Undecidability Results Concerning k-limited 0L Systems. Fundam. Informaticae 26(1): 23-30 (1996) - Joanna Jedrzejowicz:
Undecidability Results for Shuffle Languages. J. Autom. Lang. Comb. 1(2): 147-159 (1996) - 1995
- Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian:
Complexity, Decidability and Undecidability Results for Domain-Independent Planning. Artif. Intell. 76(1-2): 75-88 (1995) - John S. Schlipf:
Complexity and Undecidability Results for Logic Programming. Ann. Math. Artif. Intell. 15(3-4): 257-288 (1995) - 1993
- Zhou Chaochen, Michael R. Hansen, Peter Sestoft:
Decidability and Undecidability Results for Duration Calculus. STACS 1993: 58-68 - 1992
- John S. Schlipf:
A Survey of Complexity and Undecidability Results in Logic Programming. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 143-164 - 1991
- Friedrich Otto:
Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems. AAECC 1991: 292-303 - 1989
- Friedhelm Hinz, Jürgen Dassow:
A undecidability result for regular anguages and its applications to regulated rewriting. Bull. EATCS 38: 168-173 (1989)