All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 10

Displaying 181 – 190 of 190

Showing per page

Tuning the Zhu-Takaoka string matching algorithm and experimental results

Thomas Berry, Somasundaram Ravindran (2002)

Kybernetika

In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run time complexity. Of these algorithms a few are already famous for their speed in practice, such as the Boyer–Moore and its derivatives. We chose to evaluate the algorithms by counting the number of comparisons made and by timing how long they took to complete a given search. Using the experimental results we were able to introduce a new string matching algorithm and compared...

Two extensions of system F with (co)iteration and primitive (co)recursion principles

Favio Ezequiel Miranda-Perea (2009)

RAIRO - Theoretical Informatics and Applications

This paper presents two extensions of the second order polymorphic lambda calculus, system F, with monotone (co)inductive types supporting (co)iteration, primitive (co)recursion and inversion principles as primitives. One extension is inspired by the usual categorical approach to programming by means of initial algebras and final coalgebras; whereas the other models dialgebras, and can be seen as an extension of Hagino's categorical lambda calculus within the framework of parametric polymorphism....

Two-variable word equations

Lucian Ilie, Wojciech Plandowski (2000)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Two-variable word equations

Lucian Ilie, Wojciech Plandowski (2010)

RAIRO - Theoretical Informatics and Applications

We consider languages expressed by word equations in two variables and give a complete characterization for their complexity functions, that is, the functions that give the number of words of the same length. Specifically, we prove that there are only five types of complexities: constant, linear, exponential, and two in between constant and linear. For the latter two, we give precise characterizations in terms of the number of solutions of Diophantine equations of certain types. In particular,...

Currently displaying 181 – 190 of 190

Previous Page 10