Tree correspondence problems

DOI10.1016/0022-0000(82)90046-0zbMath0478.68089OpenAlexW2045501611MaRDI QIDQ1161310

Karel II Culik, Juergen Albert

Publication date: 1982

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(82)90046-0

zbMATH Keywords

undecidabilitydecision problems for the concatenation of rooted trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Undecidability and degrees of sets of sentences (03D35) Artificial intelligence (68T99)

Related Items (1)

A hierarchy of loop programs over binary trees

Cites Work

• Parenthesis Grammars
• A characterization of parenthesis languages
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree correspondence problems