Unification of kinded infinite trees

DOI10.1016/0020-0190(95)00100-QzbMATH Open0875.68579OpenAlexW2070784882MaRDI QIDQ1352126FDOQ1352126

Vasco T. Vasconcelos

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00100-q

zbMATH Keywords

AlgorithmsUnification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Cites Work

• On the computational power of pushdown automata
• Fundamental properties of infinite trees
• Complete sets of transformations for general E-unification

Cited In (4)

• Continuous monoids and yields of infinite trees
• Title not available (Why is that?)
• Some Wellfounded Trees in UniMath
• Representations of infinite tree sets

This page was built for publication: Unification of kinded infinite trees

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