#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1988

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos
- LPAR
- 2005

We consider several questions about monotone AC-tree automata, a class of equational tree automata [21] whose transition rules correspond to rules in Kuroda normal form of context-sensitive grammars. Whereas it is known that this class has a decision procedure to determine if a given monotone AC-tree automaton accepts no term [23], other decidability and… (More)

- Yves Roos, Marcus Karel
- Food technology
- 1991

The physical state of food components affects their properties during processing, storage, and consumption. Removal of water by evaporation or by freezing often results in formation of an amorphous state (Parks et al., 1928; Troy and Sharp, 1930; Kauzmann, 1948; Bushill et al., 1965; White and Cakebread, 1966; Slade and Levine, 1991). Amorphous foods are… (More)

- Michel Latteux, Yves Roos
- Jewels are Forever
- 1999

New representation results for three families of regular languages are stated, using a special kind of shuffle operation, namely the synchronized shuffle. First, it is proved that the family of regular star languages is the smallest family containing the language (a+ bc)∗ and closed under synchronized shuffle and length preserving morphism. The second… (More)

In this paper, we revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and the type of annotations used to define the view. First, we show that the full class of Regular XPath queries is closed under query rewriting. Next, we address the problem of… (More)

- Olivier Gauwin, Joachim Niehren, Yves Roos
- Inf. Process. Lett.
- 2008

Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the two main approaches, which have not been linked so far: automata for nested words or equivalently visibly pushdown automata, and respectively pushdown forest automata.

- Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
- MFCS
- 2004

We consider semistructured data as rooted edge-labeled directed graphs, and path inclusion constraints on these graphs. In this paper, we show that we can extract from a finite datum D a finite set Cf (D) of word inclusions, which implies exactly every word inclusion satisfied by D. Then, we give a new decision algorithm for the implication problem of a… (More)

We study the problem of update translation for views on XML documents. More precisely, given an XML view definition and a user defined view update program, find a source update program that translates the view update without side effects on the view. Additionally, we require the translation to be defined on all possible source documents; this corresponds to… (More)

We consider in this paper rooted labeled directed graphs as models for semistructured data. A path inclusion constraint, in such graphs, is an expression p q where p and q are regular expressions over the alphabet of labels. An path inclusion constraint p q is satisfied by a rooted labeled directed graph if the set of nodes reached, from the root, by the… (More)

- Benoît Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison
- Inf. Comput.
- 2014

In this paper, we revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and the type of annotations used to define the view. First, we study query rewriting with views when the classes used to defined queries and views are Regular XPath and MSO. Next, we… (More)

- Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte
- Theor. Comput. Sci.
- 2006

The task of identifying a language from a set of its words is not an easy one. For instance, it is not feasible to identify regular languages in the general case. Therefore, looking for subclasses of regular languages that can be identified in this framework is an interesting problem. One of the most classical identifiable classes is the class of reversible… (More)