More efficient left-to-right matching for overlapping pattern

DOI10.1016/j.jda.2004.08.007zbMath1101.68635OpenAlexW2074775835MaRDI QIDQ2569399

Luiza de Macedo Mourelle, Nadia Nedjah

Publication date: 27 October 2005

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.08.007

zbMATH Keywords

pattern matchingrewriting systemdeterministic automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Uses Software

• Haskell
• Miranda

Cites Work

• Comparison of priority rules in pattern matching and term rewriting
• Pattern Matching in Trees
• Adaptive Pattern Matching
• Left-to-right tree pattern matching
• High Performance Computing for Computational Science - VECPAR 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: More efficient left-to-right matching for overlapping pattern