Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
16
click to vote
STACS
2005
Springer
favorite
Email
discuss
report
108
views
Theoretical Computer Science
»
more
STACS 2005
»
Minimizing NFA's and Regular Expressions
14 years 3 months ago
Download
www.thi.informatik.uni-frankfurt.de
Gregor Gramlich, Georg Schnitger
Real-time Traffic
STACS 2005
|
Theoretical Computer Science
|
claim paper
Related Content
»
A Regular Expression Matching Circuit Based on a Decomposed Automaton
»
Explicitly Parallel Regular Expressions
»
Spacetime tradeoff in regular expression matching with semideterministic finite automata
»
Highspeed regular expression matching engine using multicharacter NFA
»
Inductive bases and their application to searches for minimal unary NFAs
»
iNFAnt NFA pattern matching on GPGPU devices
»
Fast BitParallel Matching for Network and Regular Expressions
»
Hardware implementation for scalable lookahead Regular Expression detection
»
Small NFAs from Regular Expressions Some Experimental Results
»
Three New Algorithms for Regular Language Enumeration
more »
Post Info
More Details (n/a)
Added
28 Jun 2010
Updated
28 Jun 2010
Type
Conference
Year
2005
Where
STACS
Authors
Gregor Gramlich, Georg Schnitger
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision