Descendants of a recognizable tree language for sets of linear monadic term rewrite rules

Sándor Vágvölgyi. Descendants of a recognizable tree language for sets of linear monadic term rewrite rules. Inf. Process. Lett., 99(3):111-118, 2006. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.