Time-space-optimal string matching (Q1838329)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Time-space-optimal string matching	scientific article

Statements

scholarly article

0 references

Time-space-optimal string matching (English)

0 references

zbMATH Open document ID

0 references

10.1016/0022-0000(83)90001-6

0 references

0 references

Joel I. Seiferas

0 references

Journal of Computer and System Sciences

0 references

publication date

1983

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

string-matching algorithm

0 references

six-head finite automaton

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0022-0000(83)90001-6

0 references

0 references

A fast string searching algorithm

0 references

Uniqueness Theorems for Periodic Functions

0 references

0 references

On improving the worst case running time of the Boyer-Moore string matching algorithm

0 references

Saving Space in Fast String-Matching

0 references

Linear-time string-matching using only a fixed number of local storage locations

0 references

Efficient randomized pattern-matching algorithms

0 references

Fast Pattern Matching in Strings

0 references

The equation \(a_ M=b^ Nc^ P\) in a free group

0 references

Real-time recognition of substring repetition and reversal

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1838329

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1838329&oldid=34680276"