A new approach to determinisation using bit-parallelism

Authors:
Jan Šupol;Bořivoj Melichar
Affiliations:
Department of Computer Science S Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague 2;Department of Computer Science S Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague 2
Venue:
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Year:
2006

Citing 5
Cited 0

A new approach to text searching

Communications of the ACM
Fast text searching: allowing errors

Communications of the ACM
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Coding and Information Theory

Coding and Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new approach to the determinisation process of specified types of automata using bit-parallel algorithms. We present the determinisation of nondeterministic pattern matching automata (PMA) for approximate pattern matching and we introduce the determinisation of suffix automata. This new approach speeds the determinisation up to m times, where m is the length of the pattern searched by PMA, or accepted by the suffix automaton, respectively.