Hierarchies of decidable extensions of bounded quantificationVorobyov, Sergei.1994, 29 p.Report

The laterality problem for non-erasing turing machines on {0,1} is completely solvedMARGENSTERN, M.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 2, pp 159-204, issn 0988-3754Article

Polymorphic typing with subtyping proof normalization and least type for the F≤ cloneVorobyov, Sergei.1994, 14 p.Report

Extensions of F≤ with decidable typingVorobyov, Sergei.1994, 29 p.Report

Flexible matchingsBARTHA, Miklos; KRESZ, Miklos.Lecture notes in computer science. 2006, pp 313-324, issn 0302-9743, isbn 3-540-48381-0, 12 p.Conference Paper

The joinability and unification problems for confluent semi-constructor TRSsMITSUHASHI, Ichiro; OYAMAGUCHI, Michio; OHTA, Yoshikatsu et al.Lecture notes in computer science. 2004, pp 285-300, issn 0302-9743, isbn 3-540-22153-0, 16 p.Conference Paper

Retracts in simple typesPADOVANI, Vincent.Lecture notes in computer science. 2001, pp 376-384, issn 0302-9743, isbn 3-540-41960-8Conference Paper

A unification-theoretic method for investigating the k-provability problemFARMER, W. M.Annals of pure and applied logic. 1991, Vol 51, Num 3, pp 173-214, issn 0168-0072, 42 p.Article

On the valuedness of finite transducersWEBER, A.Acta informatica. 1990, Vol 27, Num 8, pp 749-780, issn 0001-5903, 32 p.Article

The immortality problem for Lag systemsSALOMAA, K; SHENG YU.Information processing letters. 1990, Vol 36, Num 6, pp 311-315, issn 0020-0190, 5 p.Article

Sur les codes zigzag et leur décidabilité = About zigzag codes and their decidabilityANSELMO, M.Theoretical computer science. 1990, Vol 74, Num 3, pp 341-354, issn 0304-3975, 14 p.Article

Solving word equationsABDULRAB, H.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 2, pp 109-130, issn 0988-3754, 22 p.Article

Infinity of intermediate states is decidable for Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 426-434, issn 0302-9743, isbn 3-540-22236-7, 9 p.Conference Paper

Easy cases of the DOL sequence equivalence problemHONKALA, Juha.Discrete applied mathematics. 2001, Vol 113, Num 2-3, pp 285-290, issn 0166-218XArticle

Model-checking of correctness conditions for concurrent objectsALUR, R; MCMILLAN, K; PELED, D et al.Information and computation (Print). 2000, Vol 160, Num 1-2, pp 167-188, issn 0890-5401Article

The undecidability of second order multiplicative linear logicLAFONT, Y; SCEDROV, A.Information and computation (Print). 1996, Vol 125, Num 1, pp 46-51, issn 0890-5401Article

On Π₂ theories of hp-T degrees of low setsAOKI, K; SHINODA, J; TSUDA, T et al.Theoretical computer science. 1994, Vol 123, Num 2, pp 315-327, issn 0304-3975Article

F≤ with recursive types : types-as-propositions interpretation in M. Rabin's S2SVorobyov, Sergei.1994, 16 p.Report

The undecidability of the semi-unification problemKFOURY, A. J; TIURYN, J; URZYCZYN, P et al.Information and computation (Print). 1993, Vol 102, Num 1, pp 83-101, issn 0890-5401Article

Well quasi-ordered setsRICHMAN, F; STOLZENBERG, G.Advances in mathematics (New York, NY. 1965). 1993, Vol 97, Num 2, pp 145-153, issn 0001-8708Article

Réécriture modulo une théorie présentée par un système convergent et décidabilité des problèmes du mot dans certaines classes de théories équationnelles = Rewriting modulo a theory presented by a convergent system and decidability of the word problem for some clases of equational theoriesMarche, Claude; Jouannaud, Jean-Pierre.1993, 151 p.Thesis

Clifford monoid presentationsSILVA, P. V.Mathematical proceedings of the Cambridge Philosophical Society. 1992, Vol 111, Num 3, pp 445-454, issn 0305-0041Article

An elementary proof for the non-parametrizability of the equation xyz = zvxPETRE, Elena.Lecture notes in computer science. 2004, pp 807-817, issn 0302-9743, isbn 3-540-22823-3, 11 p.Conference Paper

Decidability of strong bisimilarity for timed BPPLASOTA, Slawomir.Lecture notes in computer science. 2002, pp 562-578, issn 0302-9743, isbn 3-540-44043-7, 17 p.Conference Paper

On uniform word problems involving bridging operators on distributive latticesSOFRONIE-STOKKERMANS, Viorica.Lecture notes in computer science. 2002, pp 235-250, issn 0302-9743, isbn 3-540-43929-3, 16 p.Conference Paper