String-matching with OBDDs
type: Item
instance of: scholarly article
title: String-matching with OBDDs
zbMATH Open document ID: 1068.68075
author: Sumit K. Garg
published in: Theoretical Computer Science
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2085505
zbMATH Keywords: Ordered binary decision diagrams
zbMATH Keywords: Finite automata
zbMATH Keywords: String-matching problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.11.023
OpenAlex ID: W2023839142
cites work: On the computational power of pushdown automata
cites work: On Boyer-Moore automata
cites work: Improving the variable ordering of OBDDs is NP-complete
cites work: A fast string searching algorithm
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Q4849531
cites work: Q3746902
cites work: Algorithms on Strings, Trees and Sequences
cites work: Fast Pattern Matching in Strings
cites work: Q5628016
cites work: On the Influence of the State Encoding on OBDD-Representations of Finite State Machines
cites work: Reduction of OBDDs in linear time
DOI: 10.1016/J.TCS.2003.11.023
description: scientific article; zbMATH DE number 2085505