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 set automaton to locate all pattern matches in a term

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

DOI10.1007/978-3-030-85315-0_5OpenAlexW3198724185MaRDI QIDQ2119959

Jan Friso Groote, Rick Erkens

Publication date: 31 March 2022

Full work available at URL: https://arxiv.org/abs/2106.15311


zbMATH Keywords

parallel algorithmpattern matchingset automaton


Mathematics Subject Classification ID

Theory of computing (68Qxx)


Related Items

A set automaton to locate all pattern matches in a term


Uses Software

  • mCRL2


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A set automaton to locate all pattern matches in a term
  • On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
  • Tree template matching in ranked ordered trees by pushdown automata
  • TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
  • Pattern Matching in Trees
  • Efficient string matching
  • Faster tree pattern matching
  • Nonlinear pattern matching in trees
  • Adaptive Pattern Matching
  • Left-to-right tree pattern matching
  • Derivatives of Regular Expressions
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2119959&oldid=14613091"
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 23:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki