WIA 2007 - PDF Preprint Papers

WIA 2007 International Workshop on Implementing Automata

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WIA-2007 Paper

click to vote

WIA
2007
Springer

138views Artificial Intelligence» more WIA 2007»

Accelerating Boyer Moore Searches on Binary Texts

13 years 10 months ago

Download u.cs.biu.ac.il

The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...

Shmuel Tomi Klein, Miri Ben-Nissan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	138	Accelerating Boyer Moore Searches on Binary Texts	claim
2	137	Weighted Automata and Weighted Logics with Discounting	claim
3	134	Analyzing Ambiguity of Context-Free Grammars	claim
4	134	Regulated Nondeterminism in Pushdown Automata	claim
5	129	An Implementation of Deterministic Tree Automata Minimization	claim
6	124	Linear-Time Model Checking: Automata Theory in Practice	claim
7	119	Average Value and Variance of Pattern Statistics in Rational Models	claim
8	111	A Measure for the Degree of Nondeterminism of Context-Free Languages	claim
9	96	Backward and Forward Bisimulation Minimisation of Tree Automata	claim
10	95	A New Method for Compiling Parallel Replacement Rules	claim
11	91	On String Matching in Chunked Texts	claim
12	89	Multi-grain Relations	claim
13	87	Finite State Automata Representing Two-Dimensional Subshifts	claim
14	87	Spiking Neural P Systems Used as Acceptors and Transducers	claim
15	86	Efficient Enumeration of Regular Languages	claim
16	86	Deterministic Caterpillar Expressions	claim
17	83	Efficient Computation of Throughput Values of Context-Free Languages	claim
18	81	Synchronizing Automata Preserving a Chain of Partial Orders	claim
19	80	Factor Automata of Automata and Applications	claim
20	72	Memory Reduction for Strategies in Infinite Games	claim
21	72	Subset Seed Automaton	claim
22	71	Reducing Acyclic Cover Transducers	claim
23	70	Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers