Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A new regular grammar pattern matching algorithm.

From MaRDI portal
Publication:1874408
Jump to:navigation, search

DOI10.1016/S0304-3975(02)00532-7zbMath1051.68089MaRDI QIDQ1874408

Bruce W. Watson

Publication date: 25 May 2003

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


zbMATH Keywords

Boyer-Moore algorithmPattern matching algorithmsRegular grammars


Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A taxonomy of sublinear multiple keyword pattern matching algorithms
  • A fast string searching algorithm
  • Efficient string matching
  • Fast Pattern Matching in Strings
  • A new regular grammar pattern matching algorithm
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1874408&oldid=14268452"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki