Back to Results
First PageMeta Content
Models of computation / Computer science / Applied mathematics / Deterministic finite automaton / Regular expression / Finite-state machine / Regular language / Nondeterministic finite automaton / String searching algorithm / Automata theory / Formal languages / Theoretical computer science


Efficient submatch addressing for regular expressions Master’s Thesis Ville Laurikari
Add to Reading List

Document Date: 2010-10-05 00:06:57


Open Document

File Size: 516,09 KB

Share Result on Facebook

Company

Nokia Networks / SSH Communications Security / /

Facility

Engineering Laboratory of Information Processing Science / Helsinki University of Technology / Helsinki University of Technology Department / /

IndustryTerm

on-line algorithms / information processing / type systems / data processing / submatch addressing algorithms / /

OperatingSystem

POSIX / /

Organization

UNIVERSITY OF TECHNOLOGY ABSTRACT OF MASTER’S THESIS / Faculty of Information Technology Professorship / Helsinki University of Technology Department of Computer Science and Engineering Laboratory / HELSINKI UNIVERSITY OF TECHNOLOGY / /

Person

Marko Lyly / Vera Izrailit / Petri Mäenpää / Elizabeth Heap-Talvela / Sami-Pekka Haavisto / Jussi Rautio / Angelo Borsotti / Matti Tikkanen / Eljas Soisalon-Soininen / Kenneth Oksanen Hakulauseketta / Kenneth Oksanen / Antti-Pekka Liedes / /

Position

author / Supervisor / Professor / supervisor / Professor / programmer / /

ProgrammingLanguage

Perl / Prolog / /

Technology

functional programming / 2001 Helsinki University of Technology / Perl / resulting algorithm / Simulation / on-line algorithms / Information Technology / submatch addressing algorithms / /

SocialTag