<--- Back to Details
First PageDocument Content
Theoretical computer science / Software / Pattern matching / Graphics hardware / GPGPU / Packet Processing / Nondeterministic finite automaton / Perl Compatible Regular Expressions / Snort / Automata theory / Computing / Regular expressions
Date: 2012-03-22 09:27:59
Theoretical computer science
Software
Pattern matching
Graphics hardware
GPGPU
Packet Processing
Nondeterministic finite automaton
Perl Compatible Regular Expressions
Snort
Automata theory
Computing
Regular expressions

Add to Reading List

Source URL: www.ics.forth.gr

Download Document from Source Website

File Size: 285,04 KB

Share Document on Facebook

Similar Documents

Computational complexity theory / Finite automata / Complexity classes / Theory of computation / Nondeterministic finite automaton / Regular language / PSPACE / Bchi automaton / FO / Permutation / IP / Structure

On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing

DocID: 1rggm - View Document

Finite automata / Automata theory / Nondeterministic finite automaton / Deterministic automaton / Theoretical computer science / Finite-state machine / Deterministic finite automaton / Computability / Regular language / NP / Muller automaton / Bchi automaton

Session F2C NON-DETERMINISM IN CS HIGH-SCHOOL CURRICULA Michal Armoni 1 and Judith Gal-Ezer 2 Abstract - One of the units in the relatively new high school CS curriculum which is being implemented in Israel is a

DocID: 1qIve - View Document

Finite automata / Mathematics / Science and technology / Mathematical analysis / Nondeterministic finite automaton / Finite-state machine / Automaton / John von Neumann / Deterministic finite automaton

Advantages and challenges of programming the Micron Automata Processor

DocID: 1qtpN - View Document

Finite automata / Regular language / Nondeterministic finite automaton

MCS 441 – Theory of Computation I Spring 2016 Problem Set 1 Lev Reyzin Due: at the beginning of class Instructions: Atop your problem set, please write your name and whether you are an undergraduate or graduate

DocID: 1q50x - View Document

Finite automata / Parallel computing / Microprocessors / Analysis of parallel algorithms / Nondeterministic finite automaton / Multi-core processor / Thread / Regular expression / Finite-state machine / Speedup / Deterministic finite automaton / Multiprocessing

Parallel Processing of Large-Scale XML-Based Application Documents on Multi-core Architectures with PiXiMaL Michael R. Head† Madhusudhan Govindaraju‡ Grid Computing Research Laboratory, SUNY Binghamton, NY {† mike,

DocID: 1pG49 - View Document