Undecidability in the homomorphic quasiorder of finite labeled forestsKUDINOV, Oleg V; SELIVANOV, Victor L.Lecture notes in computer science. 2006, pp 289-296, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 8 p.Conference Paper

The periodic domino problem revisitedJEANDEL, Emmanuel.Theoretical computer science. 2010, Vol 411, Num 44-46, pp 4010-4016, issn 0304-3975, 7 p.Article

On the undecidability of coherent logicBEZEM, Marc.Processes, terms and cycles : steps on the road to infinity (essays dedicated to Jan Willem Klop on the occasion of his 60th birthday). Lecture notes in computer science. 2005, pp 6-13, issn 0302-9743, isbn 3-540-30911-X, 1Vol, 8 p.Book Chapter

Finite sets of words and computing : (A Survey)KARHUMÄKI, Juhani.Lecture notes in computer science. 2005, pp 36-49, issn 0302-9743, isbn 3-540-25261-4, 14 p.Conference Paper

Some open problems in decidability of brick (labelled polyomino) codesMOCZURAD, Małgorzata; MOCZURAD, Włodzimierz.Lecture notes in computer science. 2004, pp 72-81, issn 0302-9743, isbn 3-540-22856-X, 10 p.Conference Paper

Improved matrix pair undecidability resultsHALAVA, Vesa; HIRVENSALO, Mika.Acta informatica. 2007, Vol 44, Num 3-4, pp 191-205, issn 0001-5903, 15 p.Article

Decidability of freshness, undecidability of revelationCONFORTI, Giovanni; GHELLI, Giorgio.Lecture notes in computer science. 2004, pp 105-120, issn 0302-9743, isbn 3-540-21298-1, 16 p.Conference Paper

Two undecidable variants of Collatz's problemsLEHTONEN, Eero.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 596-600, issn 0304-3975, 5 p.Article

Lowering undecidability bounds for decision questions in matricesBELL, Paul; POTAPOV, Igor.Lecture notes in computer science. 2006, pp 375-385, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 11 p.Conference Paper

Results on the guarded fragment with equivalence or transitive relationsKIERONSKI, Emanuel.Lecture notes in computer science. 2005, pp 309-324, issn 0302-9743, isbn 3-540-28231-9, 16 p.Conference Paper

Head and state hierarchies for unary multi-head finite automataKUTRIB, Martin; MALCHER, Andreas; WENDLANDT, Matthias et al.Acta informatica. 2014, Vol 51, Num 8, pp 553-569, issn 0001-5903, 17 p.Article

From post systems to the reachability problems for matrix semigroups and multicounter automataPOTAPOV, Igor.Lecture notes in computer science. 2004, pp 345-356, issn 0302-9743, isbn 3-540-24014-4, 12 p.Conference Paper

New proof for the undecidability of the circular PCPHALAVA, Vesa; HARJU, Tero.Acta informatica. 2013, Vol 50, Num 5-6, pp 331-341, issn 0001-5903, 11 p.Article

Approche évolutionniste de la recherche d'automates cellulaires universelsSAPIN, Emmanuel.TSI. Technique et science informatiques. 2006, Vol 25, Num 8-9, pp 1127-1155, issn 0752-4072, 29 p.Article

Uncomputability below the real halting problemMEER, Klaus; ZIEGLER, Martin.Lecture notes in computer science. 2006, pp 368-377, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 10 p.Conference Paper

Axiomatizing the logical core of XPath 2.0TEN CATE, Balder; MARX, Maarten.Lecture notes in computer science. 2006, pp 134-148, issn 0302-9743, isbn 978-3-540-69269-0, 1Vol, 15 p.Conference Paper

Algebraic intruder deductionsBASIN, David; MÖDERSHEIM, Sebastian; VIGANO, Luca et al.Lecture notes in computer science. 2005, pp 549-564, issn 0302-9743, isbn 3-540-30553-X, 1Vol, 16 p.Conference Paper

The 4-way deterministic tiling problem is undecidableLUKKARILA, Ville.Theoretical computer science. 2009, Vol 410, Num 16, pp 1516-1533, issn 0304-3975, 18 p.Article

From sandpiles to sand automataCERVELLE, Julien; FORMENTI, Enrico; MASSON, Benoit et al.Theoretical computer science. 2007, Vol 381, Num 1-3, pp 1-28, issn 0304-3975, 28 p.Article

The domino problem of the hyperbolic plane is undecidableMARGENSTERN, Maurice.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 29-84, issn 0304-3975, 56 p.Article

On keys and functional dependencies as first-class citizens in description logicsTOMAN, David; WEDDELL, Grant.Lecture notes in computer science. 2006, pp 647-661, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 15 p.Conference Paper

Principal Type Inference for GHC-Style Multi-parameter Type ClassesSULZMANN, Martin; SCHRIJVERS, Tom; STUCKEY, Peter J et al.Lecture notes in computer science. 2006, pp 26-43, issn 0302-9743, isbn 3-540-48937-1, 1Vol, 18 p.Conference Paper

Vérifier les protocoles cryptographiquesCORTIER, Véronique.TSI. Technique et science informatiques. 2005, Vol 24, Num 1, pp 115-140, issn 0752-4072, 26 p.Article

On the dynamic increase of multiplicities in matrix proof methods for classical higher-order logicAUTEXIER, Serge.Lecture notes in computer science. 2005, pp 48-62, issn 0302-9743, isbn 3-540-28931-3, 15 p.Conference Paper

Primitive rewritingDERSHOWITZ, Nachum.Processes, terms and cycles : steps on the road to infinity (essays dedicated to Jan Willem Klop on the occasion of his 60th birthday). Lecture notes in computer science. 2005, pp 127-147, issn 0302-9743, isbn 3-540-30911-X, 1Vol, 21 p.Book Chapter