( en | de | ru )

 

Disambiguation of "Tison, Sophie"

Author of the publication

copydeleteadd this publication to your clipboard
Co-definite Set Constraints with Membership Expressions.

, , and . IJCSLP, page 25-39. MIT Press, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Charles Tison

Tison Kasanda-Kayembe

Sophie Buchholz

Sophie Illch

Sophie Wichers

 

Other publications of authors with the same name

Decidability of the Confluence of Ground Term Rewriting Systems, , , and . LICS, page 353-359. IEEE Computer Society, (1987)Regular Tree Languages and Rewrite Systems., and . Fundam. Informaticae, 24 (1/2): 157-174 (1995)Tree Automata and Term Rewrite Systems.. RTA, volume 1833 of Lecture Notes in Computer Science, page 27-30. Springer, (2000)Solving Systems of Set Constraints using Tree Automata., , and . STACS, volume 665 of Lecture Notes in Computer Science, page 505-514. Springer, (1993)BHDL: Circuit Design in B., , , , and . ACSD, page 241-242. IEEE Computer Society, (2003)Metrical an Ordered Properties of Powerdomains., , and . FCT, volume 158 of Lecture Notes in Computer Science, page 465-474. Springer, (1983)Fair Termination is Decidable for Ground Systems.. RTA, volume 355 of Lecture Notes in Computer Science, page 462-476. Springer, (1989)Structural complexity of classes of tree languages., and . Tree Automata and Languages, North-Holland, (1992)Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms., , and . Theor. Comput. Sci., 281 (1-2): 219-233 (2002)Containment of Regular Path Queries Under Path Constraints., and . ICDT, volume 290 of LIPIcs, page 17:1-17:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)