RAIRO - Theoretical Informatics and Applications E-first ...

Home
CJO Mobile
Mobile Device Twinning
Contact Us
Site Map
Help
FAQ
Accessibility
Register

Basket
Log in

User Log-in
Institutional Log-in
Register for an Account

Username or Email Address:

Password:

Remember me

Forgot your Password? Log in

Trouble Logging in?

You can also login through:

Facebook
Twitter
Google Plus

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

Register for an Account

Journal Information

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

RAIRO - Theoretical Informatics and Applications Home

Save Journal to My CJO Account

Browse Journal

E-first Articles
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

Advertising and Corporate Sales

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
>
E-first

RAIRO - Theoretical Informatics and Applications

New Content Alerts
CJO Widget About Widget
Rss
Atom

Table of Contents - E-first ...

View Table of Contents as PDF
Forward TOC

Select All
Deselect All

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

Add to Basket

Research Articles

Decidability of the HD0L ultimate periodicity problem Decidability of the HD0L ultimate periodicity problem

false

Abstract
Article Structure
Figures and Tables
References

Fabien Durand

RAIRO - Theoretical Informatics and Applications / E-first

© EDP Sciences 2013

Published online by Cambridge University Press: 25 April 2013

DOI: http://dx.doi.org/10.1051/ita/2013035 (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_US.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 constructing infinite binary words with polynomial subword complexity A note on constructing infinite binary words with polynomial subword complexity

false

Abstract
Article Structure
Figures and Tables
References

Francine Blanchet-Sadri, Bob Chen and Sinziana Munteanu

RAIRO - Theoretical Informatics and Applications / E-first

© EDP Sciences 2013

Published online by Cambridge University Press: 25 April 2013

DOI: http://dx.doi.org/10.1051/ita/2013033 (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_US.toc.displayArticle.1000 ??? characters remaining

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

Abelian periods, partial words, and an extension of a theorem of Fine and Wilf Abelian periods, partial words, and an extension of a theorem of Fine and Wilf

false

Abstract
Article Structure
Figures and Tables
References

Francine Blanchet-Sadri, Sean Simmons, Amelia Tebbe and Amy Veprauskas

RAIRO - Theoretical Informatics and Applications / E-first

© EDP Sciences 2013

Published online by Cambridge University Press: 25 April 2013

DOI: http://dx.doi.org/10.1051/ita/2013034 (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_US.toc.displayArticle.1000 ??? characters remaining

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

Cutwidth of iterated caterpillars Cutwidth of iterated caterpillars

false

Abstract
Article Structure
Figures and Tables
References

Lan Lin and Yixun Lin

RAIRO - Theoretical Informatics and Applications / E-first

© EDP Sciences 2013

Published online by Cambridge University Press: 11 March 2013

DOI: http://dx.doi.org/10.1051/ita/2012032 (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_US.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 tight bound for exhaustive key search attacks against Message Authentication Codes A tight bound for exhaustive key search attacks against Message Authentication Codes

false

Abstract
Article Structure
Figures and Tables
References

Vinícius G.P. de SÁ, Davidson R. Boccardo, Luiz Fernando Rust and Raphael C.S. Machado

RAIRO - Theoretical Informatics and Applications / E-first

© EDP Sciences 2012

Published online by Cambridge University Press: 06 November 2012

DOI: http://dx.doi.org/10.1051/ita/2012025 (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_US.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 hardness of game equivalence under local isomorphism On the hardness of game equivalence under local isomorphism

false

Abstract
Article Structure
Figures and Tables
References

Joaquim Gabarró, Alina García and Maria Serna

RAIRO - Theoretical Informatics and Applications / E-first

© EDP Sciences 2012

Published online by Cambridge University Press: 05 November 2012

DOI: http://dx.doi.org/10.1051/ita/2012024 (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_US.toc.displayArticle.1000 ??? characters remaining

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

Signed Chip Firing Games and Symmetric Sandpile Models on the cycles Signed Chip Firing Games and Symmetric Sandpile Models on the cycles

false

Abstract
Article Structure
Figures and Tables
References

Robert Cori, Thi Ha Duong Phan and Thi Thu Huong Tran

RAIRO - Theoretical Informatics and Applications / E-first

© EDP Sciences 2012

Published online by Cambridge University Press: 31 October 2012

DOI: http://dx.doi.org/10.1051/ita/2012023 (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_US.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

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

© Cambridge University Press

Powered by:

Cambridge Journals

Cross Ref
Cited by CrossRef
Project Counter
Level Double-A conformance icon, W3C-WAI Web Content Accessibility Guidelines 1.0
RSS Feed
Get Adobe Reader
Automated Content Access Protocol enabled