Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning

DOI10.1007/978-3-540-70844-5_15zbMATH Open1172.68501OpenAlexW1539257277MaRDI QIDQ3602809FDOQ3602809

Authors: Ryan Dixon, Ömer Eğecioğlu, Timothy Sherwood 

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_15

Recommendations

• ANALYSIS OF BIT-SPLIT LANGUAGES FOR PACKET SCANNING AND EXPERIMENTS WITH WILDCARD MATCHING
• Fast Deep Packet Inspection with a Dual Finite Automata
• STACS 2004
• An Evaluation of Automata Algorithms for String Analysis
• A SAT-based technique to analyse networks of finite automata
• Analysis of Communicating Automata
• Automata and program analysis
• Input-trees of finite automata and application to cryptanalysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (1)

• ANALYSIS OF BIT-SPLIT LANGUAGES FOR PACKET SCANNING AND EXPERIMENTS WITH WILDCARD MATCHING

This page was built for publication: Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602809)