Sciweavers

Share
IANDC
2011
119views more  IANDC 2011»
8 years 4 months ago
Quantitative Kleene coalgebras
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
IANDC
2011
69views more  IANDC 2011»
8 years 4 months ago
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. ...
IANDC
2011
148views more  IANDC 2011»
8 years 4 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
IANDC
2011
129views more  IANDC 2011»
8 years 4 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
IANDC
2011
91views more  IANDC 2011»
8 years 4 months ago
Queries on Xml streams with bounded delay and concurrency
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
Olivier Gauwin, Joachim Niehren, Sophie Tison
IANDC
2011
59views more  IANDC 2011»
8 years 4 months ago
Proof systems that take advice
Olaf Beyersdorff, Johannes Köbler, Sebastian ...
IANDC
2011
84views more  IANDC 2011»
8 years 4 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann
IANDC
2011
127views more  IANDC 2011»
8 years 4 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
books