Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Efficient tree pattern unification

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

DOI10.1007/BFB0037425zbMATH Open1541.68183MaRDI QIDQ6560197FDOQ6560197

Peter Ružička

Publication date: 21 June 2024





Mathematics Subject Classification ID

Data structures (68P05) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)


Cites Work

  • Efficient string matching
  • Parallel construction of a suffix tree with applications
  • Title not available (Why is that?)
  • Pattern Matching in Trees
  • Nonlinear pattern matching in trees
  • An almost linear Robinson unification algorithm
  • Title not available (Why is that?)







This page was built for publication: Efficient tree pattern unification

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6560197&oldid=40093816"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 17:05. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki