String-matching with OBDDs

DOI10.1016/j.tcs.2003.11.023zbMath1068.68075OpenAlexW2023839142MaRDI QIDQ596086

Sumit K. Garg

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.11.023

zbMATH Keywords

Finite automataOrdered binary decision diagramsString-matching problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

An artificial neural network based approach for online string matching/filtering of large databases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reduction of OBDDs in linear time
• On Boyer-Moore automata
• On the computational power of pushdown automata
• A fast string searching algorithm
• Graph-Based Algorithms for Boolean Function Manipulation
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• On the Influence of the State Encoding on OBDD-Representations of Finite State Machines
• Improving the variable ordering of OBDDs is NP-complete

This page was built for publication: String-matching with OBDDs