scientific article; zbMATH DE number 3883604

MaRDI QIDQ3217596zbMATH OpenFDO

Authors Michèle Soria, Jean-Marc Steyaert

Publication date 1984

zbMATH Keywords

asymptotic analysisaverage time complexitycombinatorial analysisgeneralized Pattern Matching algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Recommendations

• Patterns and pattern-matching in trees: An analysis
• scientific article; zbMATH DE number 862545
• Average-case analysis of pattern-matching in trees under the BST probability model
• Waiting time and complexity for matching patterns with automata
• An analytical comparison of two string searching algorithms

Cited in

(2)

• Complexity analysis of term-rewriting systems
• Average Case Analysis of Marking Algorithms

This page was built for publication:

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