A New Method for Compiling Parallel Replacement Rules

DOI10.1007/978-3-540-76336-9_34zbMath1139.68349OpenAlexW1538883265MaRDI QIDQ3503927

Kimmo Koskenniemi, Anssi Yli-Jyrä

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

regular relationsconditional replacementfinite-state compilationtwo-level rules

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Multi-grain Relations

Cites Work

• Finite state transducers with predicates and identities

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