Sophie Tison

2009
45	EE	Olivier Gauwin, Joachim Niehren, Sophie Tison: Bounded Delay and Concurrency for Earliest Query Answering. LATA 2009: 350-361
2008
44	EE	Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Tree Automata with Global Constraints. Developments in Language Theory 2008: 314-326
43	EE	Guillem Godoy, Sebastian Maneth, Sophie Tison: Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FoSSaCS 2008: 127-141
42	EE	Emmanuel Filiot, Sophie Tison: Regular n-ary Queries in Trees and Variable Independence. IFIP TCS 2008: 429-443
41	EE	Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison: Complexity of Earliest Query Answering with Streaming Tree Automata. PLAN-X 2008
2007
40	EE	Guillem Godoy, Sophie Tison: On the Normalization and Unique Normalization Properties of Term Rewrite Systems. CADE 2007: 247-262
39	EE	Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Satisfiability of a Spatial Logic with Tree Variables. CSL 2007: 130-145
38	EE	Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison: Polynomial time fragments of XPath with variables. PODS 2007: 205-214
37	EE	Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison: Path constraints in semistructured data. Theor. Comput. Sci. 385(1-3): 11-33 (2007)
2006
36		Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison: Composing Monadic Queries in Trees. PLAN-X 2006: 61-70
2005
35	EE	Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison: N-Ary Queries by Tree Automata. DBPL 2005: 217-231
34	EE	Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison: N-ary Queries by Tree Automata. Foundations of Semistructured Data 2005
33	EE	Iovka Boneva, Jean-Marc Talbot, Sophie Tison: Expressiveness of a Spatial Logic for Trees. LICS 2005: 280-289
32	EE	Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos: Monotone AC-Tree Automata. LPAR 2005: 337-351
2004
31	EE	Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison: Extraction and Implication of Path Constraints. MFCS 2004: 863-875
2003
30	EE	Ammar Aljer, Philippe Devienne, Sophie Tison, Jean-Louis Boulanger, Georges Mariano: BHDL: Circuit Design in B. ACSD 2003: 241-242
2002
29		Sophie Tison: Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings Springer 2002
28	EE	Max Dauchet, Sophie Tison, Marc Tommasi: Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. Theor. Comput. Sci. 281(1-2): 219-233 (2002)
2001
27	EE	Franck Seynhaeve, Sophie Tison, Marc Tommasi, Ralf Treinen: Grid structures and undecidable constraint theories. Theor. Comput. Sci. 258(1-2): 453-490 (2001)
2000
26		Horst Reichel, Sophie Tison: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings Springer 2000
25		Sophie Tison: Tree Automata and Term Rewrite Systems. RTA 2000: 27-30
24		Jean-Marc Talbot, Philippe Devienne, Sophie Tison: Generalized Definite Set Constraints. Constraints 5(1/2): 161-202 (2000)
23	EE	Joachim Niehren, Sophie Tison, Ralf Treinen: On rewrite constraints and context unification. Inf. Process. Lett. 74(1-2): 35-40 (2000)
1999
22		Christoph Meinel, Sophie Tison: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings Springer 1999
21	EE	Franck Seynhaeve, Sophie Tison, Marc Tommasi: Homomorphisms and Concurrent Term Rewriting. FCT 1999: 475-487
20		Bruno Bogaert, Franck Seynhaeve, Sophie Tison: The Recognizability Problem for Tree Automata with Comparisons between Brothers. FoSSaCS 1999: 150-164
19	EE	Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi: Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. RTA 1999: 103-117
18		Rémi Gilleron, Sophie Tison, Marc Tommasi: Set Constraints and Automata. Inf. Comput. 149(1): 1-41 (1999)
1998
17		Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Co-definite Set Constraints with Membership Expressions. IJCSLP 1998: 25-39
1997
16		Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Solving Classes of Set Constraints with Tree Automata. CP 1997: 62-76
15		Jean-Marc Talbot, Sophie Tison, Philippe Devienne: Set-Based Analysis for Logic Programming and Tree Automata. SAS 1997: 127-140
1995
14		Rémi Gilleron, Sophie Tison: Regular Tree Languages and Rewrite Systems. Fundam. Inform. 24(1/2): 157-174 (1995)
1994
13		Sophie Tison: Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, U.K., April 11-13, 1994, Proceedings Springer 1994
12		Rémi Gilleron, Sophie Tison, Marc Tommasi: Some new Decidability Results on Positive and Negative Set Constraints. CCL 1994: 336-351
1993
11		Rémi Gilleron, Sophie Tison, Marc Tommasi: Solving Systems of Set Constraints with Negated Subset Relationships FOCS 1993: 372-380
10		Rémi Gilleron, Sophie Tison, Marc Tommasi: Solving Systems of Set Constraints using Tree Automata. STACS 1993: 505-514
1992
9		Bruno Bogaert, Sophie Tison: Equality and Disequality Constraints on Direct Subterms in Tree Automata. STACS 1992: 161-171
8		Max Dauchet, Sophie Tison: Structural complexity of classes of tree languages. Tree Automata and Languages 1992: 327-354
1990
7		Max Dauchet, Sophie Tison: The Theory of Ground Rewrite Systems is Decidable LICS 1990: 242-248
6		Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison: Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems Inf. Comput. 88(2): 187-201 (1990)
1989
5		Jean-Luc Coquidé, Max Dauchet, Sophie Tison: About Connections Between Syntactical and Computational Complexity. FCT 1989: 105-115
4		Sophie Tison: Fair Termination is Decidable for Ground Systems. RTA 1989: 462-476
1987
3		Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne: Decidability of the Confluence of Ground Term Rewriting Systems LICS 1987: 353-359
1985
2		Max Dauchet, Sophie Tison: Decidability of confluence for ground term rewriting systems. FCT 1985: 80-89
1983
1		Sophie Tison, Max Dauchet, Gérard Comyn: Metrical an Ordered Properties of Powerdomains. FCT 1983: 465-474

Coauthor Index

1	Ammar Aljer	[30]
2	Yves Andre	[31] [37]
3	Bruno Bogaert	[9] [20]
4	Iovka Boneva	[33]
5	Jean-Louis Boulanger	[30]
6	Anne-Cécile Caron	[19] [31] [37] [41]
7	Gérard Comyn	[1]
8	Jean-Luc Coquidé	[5]
9	Max Dauchet	[1] [2] [3] [5] [6] [7] [8] [28]
10	Denis Debarbieux	[31] [37]
11	Philippe Devienne	[15] [16] [17] [24] [30]
12	Emmanuel Filiot	[36] [38] [39] [42] [44]
13	Olivier Gauwin	[41] [45]
14	Rémi Gilleron	[10] [11] [12] [14] [18]
15	Guillem Godoy	[40] [43]
16	Thierry Heuillard	[3] [6]
17	Pierre Lescanne	[3] [6]
18	Sebastian Maneth	[43]
19	Georges Mariano	[30]
20	Christoph Meinel	[22]
21	Joachim Niehren	[23] [34] [35] [36] [38] [41] [45]
22	Hitoshi Ohsaki	[32]
23	Laurent Planque	[34] [35]
24	Horst Reichel	[26]
25	Yves Roos	[31] [32] [37]
26	Franck Seynhaeve	[19] [20] [21] [27]
27	Jean-Marc Talbot	[15] [16] [17] [24] [32] [33] [34] [35] [36] [38] [39] [44]
28	Marc Tommasi	[10] [11] [12] [18] [19] [21] [27] [28]
29	Ralf Treinen	[23] [27]

Colors in the list of coauthors