Ontology is a way to represent the domain knowledge into a human understandable and
machine readable format. It is used as one of the major knowledge representation …

Tree pattern matching on ordered trees is an important problem in Computer Science.
Ordered trees can be represented as strings with additional properties via various …

In this note we present three efficient variations of the occurrence heuristic, adopted by many
exact string matching algorithms and first introduced in the well-known Boyer–Moore …

Earlier publications provided an abstract specification of a family of single keyword pattern
matching algorithms 18 which search unexamined portions of the text in a divide-and …

A software chrestomathy is a collection of software systems ('contributions') meant to be
useful in learning about or gaining insight into programming and software engineering. We …

A so-called dead-zone pattern matching family of algorithms has previously been proposed
as a concept. Here the performance of several instances of the family are empirically …

Abstract Correctness-by-construction (CbC) is an approach for develo** algorithms inline
with rigorous correctness arguments. A high-level specification is evolved into an …

© University of Pretoria Page 1 © University of Pretoria Page 2 Topic Maps for Specifying
Algorithm Taxonomies: A Case Study using Transitive Closure Algorithms Vreda Pieterse …

Given a deterministic finite automaton (DFA) A, we present a simple algorithm for
constructing four deterministic finite automata that accept the shortest forbidden factors, the …

Quantum leap matching is introduced as a generic pattern matching strategy for the single
keyword exact pattern matching problem, that can be used on top of existing Boyer-Moore …