PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Tison, Sophie"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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.

Sophie Ohnmacht University of Stuttgart

Sophie Förste University of Stuttgart

Lea-Sophie Hornberger University of Stuttgart

Hannah Sophie Boltze University of Stuttgart

Marla-Sophie Schmid University of Stuttgart

 

Other publications of authors with the same name

Composing Monadic Queries in Trees., , , and . PLAN-X, page 61-70. BRICS, Department of Computer Science, University of Aarhus, (2006)Grid structures and undecidable constraint theories., , , and . Theor. Comput. Sci., 258 (1-2): 453-490 (2001)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)Metrical an Ordered Properties of Powerdomains., , and . FCT, volume 158 of Lecture Notes in Computer Science, page 465-474. Springer, (1983)Earliest Query Answering for Deterministic Nested Word Automata., , and . FCT, volume 5699 of Lecture Notes in Computer Science, page 121-132. Springer, (2009)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)Co-definite Set Constraints with Membership Expressions., , and . IJCSLP, page 25-39. MIT Press, (1998)The Recognizability Problem for Tree Automata with Comparisons between Brothers., , and . FoSSaCS, volume 1578 of Lecture Notes in Computer Science, page 150-164. Springer, (1999)Homomorphisms and Concurrent Term Rewriting., , and . FCT, volume 1684 of Lecture Notes in Computer Science, page 475-487. Springer, (1999)