Rational tree relations | Zendy

Jean-Claude Raoult | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Rational tree relations

Author(s) -

Jean-Claude Raoult

Publication year - 1997

Publication title -

bulletin of the belgian mathematical society - simon stevin

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.36

H-Index - 31

eISSN - 2034-1970

pISSN - 1370-1444

DOI - 10.36045/bbms/1105730627

Subject(s) - substitution (logic) , copying , iterated function , tree (set theory) , computer science , mathematics , theoretical computer science , pure mathematics , algebra over a field , discrete mathematics , programming language , combinatorics , law , mathematical analysis , political science

We investigate forests and relations on trees generated by grammars in which the non-terminals represent relations. This introduces some synchronization between productions. We show that these sets are also solutions of systems of equations, that they are described by rational expressions involving union, substitution and iterated substitution, and that they are preserved by residuals. We show that they are the images of k-copying descending transducers. Finally, we isolate a subset of these relations which is preserved by composition.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research