( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A linear-time algorithm to decide whether a binary word contains an overlap.

. Bulletin of the EATCS, (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

J A Werner

A J Zensus

Manuel J A Eugster

Manuel J A Eugster

Jacobus A L J J Geijsen

 

Другие публикации лиц с тем же именем

What Are Polymorphically-Typed Ambients?, , и . ESOP, том 2028 из Lecture Notes in Computer Science, стр. 206-220. Springer, (2001)A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap.. RAIRO Theor. Informatics Appl., 22 (2): 135-145 (1988)Type theory and rewriting theory for expressive, efficient and reliable programming languages.. ACM SIGSOFT Softw. Eng. Notes, 25 (1): 61-62 (2000)On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures., , и . Theor. Comput. Sci., 93 (1): 1-41 (1992)The Undecidability of the Semi-unification Problem, , и . Inf. Comput., 102 (1): 83-101 (января 1993)The Hierarchy of Finitely Typed Functional Programs (Short Version), , и . LICS, стр. 225-235. IEEE Computer Society, (1987)Principality and Decidable Type Inference for Finite-Rank Intersection Types., и . POPL, стр. 161-174. ACM, (1999)Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report)., и . Logic of Programs, том 164 из Lecture Notes in Computer Science, стр. 279-289. Springer, (1983)Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic.. Logic of Programs, том 131 из Lecture Notes in Computer Science, стр. 150-166. Springer, (1981)Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic). Inf. Control., 65 (2/3): 98-121 (мая 1985)