Sciweavers

RSA
2008
87views more  RSA 2008»
13 years 10 months ago
A combinatorial approach to jumping particles: The parallel TASEP
In this paper we continue the combinatorial study of models of particles jumping on a row of cells which we initiated with the standard totally asymmetric exclusion process or TASE...
Enrica Duchi, Gilles Schaeffer
LOBJET
2000
84views more  LOBJET 2000»
13 years 11 months ago
Typing Concurrent Objects and Actors
ABSTRACT. As informal methods do little to help their use for concurrent and distributed programming, one of the most challenging current tasks is to build tools based on formal me...
Fabien Dagnat, Marc Pantel, Matthias Colin, Patric...
ACTA
2002
84views more  ACTA 2002»
13 years 11 months ago
Formal properties of XML grammars and languages
We consider XML documents described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties...
Jean Berstel, Luc Boasson
RIA
2006
84views more  RIA 2006»
13 years 11 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier
EJC
2008
13 years 11 months ago
Tabloids and weighted sums of characters of certain modules of the symmetric groups
We consider certain modules of the symmetric groups whose basis elements are called tabloids. As modules of the symmetric groups, some of these are isomorphic to Springer modules. ...
Yasuhide Numata
RIAO
2004
14 years 16 days ago
Multilingual document clusters discovery
Cross Language Information Retrieval community has brought up search engines over multilingual corpora, and multilingual text categorization systems. In this paper, we focus on th...
Benoît Mathieu, Romaric Besançon, Chr...
ATVA
2009
Springer
100views Hardware» more  ATVA 2009»
14 years 5 months ago
Dynamic Observers for the Synthesis of Opaque Systems
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
Franck Cassez, Jérémy Dubreil, Herv&...