The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations

DOI10.1016/0020-0190(90)90041-UzbMATH Open0706.68077OpenAlexW2016359936MaRDI QIDQ918726

Zoltán Fülöp, Sándor Vágvölgyi

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90041-u

zbMATH Keywords

automata theorypost correspondence problemmodular tree transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• The universality of higher-order attributed tree transducers
• Title not available (Why is that?)

This page was built for publication: The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations

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