Towards More Precise Rewriting Approximations

DOI10.1007/978-3-319-15579-1_51zbMath1425.68153OpenAlexW1183479258MaRDI QIDQ2799215

Jacques Chabin, Pierre Réty, Yohan Boichut

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_51

zbMATH Keywords

reachabilitylogic programmingterm rewritingtree languages

Mathematics Subject Classification ID

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

Related Items (1)

Multiple context-free tree grammars: lexicalization and characterization

This page was built for publication: Towards More Precise Rewriting Approximations