RAIRO - Theoretical Informatics and Applications Vol. 43 Iss. 02

About Us
News
Browse Journals
Authors
- Authors Home
Societies
- Societies Home
Librarians
Agents
- Agents Home
Users
- Users Home
Corporate
- Corporate Home

Citation Search
Quick Search

Advanced Search

Welcome to Cambridge Journals Online

To access subscriptions and personalised features please log in or register

Journal Information

Editorial Board
RAIRO - Theoretical Informatics and Applications News
Instructions for Contributors
Transfer of Copyright
Abstracting & Indexing Services
Advertising Information
Impact Factor

Journal Menu

RAIRO - Theoretical Informatics and Applications Home

Save Journal to My CJO Account

Browse Journal

E-first
Latest Issue
Back Issues

Browse Articles

Forthcoming
Most Downloaded
Most Cited

Submit Your Article
Sign-Up for Contents Alerts

Subscribe & Recommend Journal

Subscribe to Journal

Related Journals

RAIRO - Operations Research

Special Sales

Advertising and Corporate Sales

Tools

CJO Search Widget What is this?
Add Cambridge Journals Online as a search option in your browser toolbar. What is this?

Access Information

Consortia Access
Free Access
Individual Access
Open Access
Pay-per-View Access
Subscription Access

Home
>
RAIRO - Theoretical Informatics and Applications
>
Vol. 43 Issue 02

RAIRO - Theoretical Informatics and Applications

New Content Alerts
CJO Widget About Widget
Rss
Atom

Table of Contents - April 2009 - Volume 43 - Issue 02

View Table of Contents as PDF
Forward TOC

Previous Issue
Next Issue

Select All
Deselect All

View Selected Abstracts
Save to My Saved Articles
Export Citation (s)
Download PDF (s)

Add to Basket

Research Articles

Repetitions and permutations of columns in the semijoin algebra Repetitions and permutations of columns in the semijoin algebra

false

preview

Abstract
Article Structure
Figures and Tables
References

Dirk Leinders and Jan Van Den Bussche

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 179 - 187

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2008023 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

On the power of randomization for job shop scheduling with k-units length tasks On the power of randomization for job shop scheduling with k-units length tasks

false

preview

Abstract
Article Structure
Figures and Tables
References

Tobias Mömke

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 189 - 207

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2008024 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

The theorem of Fine and Wilf for relational periods The theorem of Fine and Wilf for relational periods

false

preview

Abstract
Article Structure
Figures and Tables
References

Vesa Halava, Tero Harju and Tomi Kärki

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 209 - 220

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2008025 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Minimal NFA and biRFSA Languages Minimal NFA and biRFSA Languages

false

preview

Abstract
Article Structure
Figures and Tables
References

Michel Latteux, Yves Roos and Alain Terlutte

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 221 - 237

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2008022 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

A note on dual approximation algorithms for class constrained bin packing problems A note on dual approximation algorithms for class constrained bin packing problems

false

preview

Abstract
Article Structure
Figures and Tables
References

Eduardo C. Xavier and Flàvio Keidi Miyazawa

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 239 - 248

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2008027 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Thread algebra for noninterference Thread algebra for noninterference

false

preview

Abstract
Article Structure
Figures and Tables
References

Thuy Duong Vu

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 249 - 268

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2008026 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Polynomial languages with finite antidictionaries Polynomial languages with finite antidictionaries

false

preview

Abstract
Article Structure
Figures and Tables
References

Arseny M. Shur

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 269 - 279

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2008028 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Efficient validation and construction of border arrays and validation of string matching automata Efficient validation and construction of border arrays and validation of string matching automata

false

preview

Abstract
Article Structure
Figures and Tables
References

Jean-Pierre Duval, Thierry Lecroq and Arnaud Lefebvre

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 281 - 297

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2008030 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Directive words of episturmian words: equivalences and normalization Directive words of episturmian words: equivalences and normalization

false

preview

Abstract
Article Structure
Figures and Tables
References

Amy Glen, Florence Levé and Gwénaël Richomme

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 299 - 319

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2008029 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Tree Automata and Automata on Linear Orderings Tree Automata and Automata on Linear Orderings

false

preview

Abstract
Article Structure
Figures and Tables
References

Véronique Bruyère, Olivier Carton and Géraud Sénizergues

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 321 - 338

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita/2009009 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Highly Undecidable Problems For Infinite Computations Highly Undecidable Problems For Infinite Computations

false

preview

Abstract
Article Structure
Figures and Tables
References

Olivier Finkel

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 339 - 364

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita/2009001 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

On context-free rewriting with a simple restriction and its computational completeness On context-free rewriting with a simple restriction and its computational completeness

false

preview

Abstract
Article Structure
Figures and Tables
References

Tomáš Masopust and Alexander Meduna

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 365 - 378

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita/2009002 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Nested Sibling Tree Automata Nested Sibling Tree Automata

false

preview

Abstract
Article Structure
Figures and Tables
References

Françoise Gire and Jean-Marc Talbot

RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 02 / 2009, pp 379 - 402

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita/2009006 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

View Selected Abstracts
Save to My Saved Articles
Export Citation (s)
Download PDF (s)

Add to Basket

View Table of Contents as PDF
Forward TOC

Previous Issue
Next Issue

Copyright Statement
Rights and Permissions
Privacy Policy
Terms of Use
Feedback
Press Releases