PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

DOI10.1142/S0129054102001515zbMath1067.68082OpenAlexW2001329538MaRDI QIDQ3021992

Luiza de Macedo Mourelle, Nadia Nedjah

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001515

zbMATH Keywords

pattern matchingterm rewritingtree automatondag automaton

Mathematics Subject Classification ID

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

Cites Work

• Implementation of an interpreter for abstract equations
• Pattern Matching in Trees
• Fast Pattern Matching in Strings
• Adaptive Pattern Matching

This page was built for publication: PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES