A New Method for Compiling Parallel Replacement Rules

DOI10.1007/978-3-540-76336-9_34MaRDI QIDQ3503927zbMATH OpenOpenAlexFDO

Authors Anssi Yli-Jyrä, Kimmo Koskenniemi

Publication date 10 June 2008

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-76336-9_34

zbMATH Keywords

conditional replacementfinite-state compilationregular relationstwo-level rules

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Compiling concurrent rewriting onto the Rewrite Rule Machine
• scientific article; zbMATH DE number 7488335
• Recent Trends in Algebraic Development Techniques
• scientific article; zbMATH DE number 4092749
• scientific article; zbMATH DE number 1045406

Cites work

• Finite state transducers with predicates and identities

Cited in

(1)

• Multi-grain Relations

This page was built for publication: A New Method for Compiling Parallel Replacement Rules

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