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

RAIRO - Theoretical Informatics and Applications

New Content Alerts
CJO Widget About Widget
Rss
Atom

Table of Contents - April 2008 - Volume 42 - 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

Efficiency of automata in semi-commutation verification techniques Efficiency of automata in semi-commutation verification techniques

false

preview

Abstract
Article Structure
Figures and Tables
References

Gérard Cécé, Pierre-Cyrille Héam and Yann Mainier

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 197 - 215

Published online by Cambridge University Press: 23 March 2011

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

Binary operations on automatic functions Binary operations on automatic functions

false

preview

Abstract
Article Structure
Figures and Tables
References

Juhani Karhumäki, Jarkko Kari and Joachim Kupke

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 217 - 236

Published online by Cambridge University Press: 23 March 2011

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

Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming

false

preview

Abstract
Article Structure
Figures and Tables
References

Maria Serna and Fatos Xhafa

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 237 - 252

Published online by Cambridge University Press: 23 March 2011

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

Hierarchies of function classes defined by the first-value operator Hierarchies of function classes defined by the first-value operator

false

preview

Abstract
Article Structure
Figures and Tables
References

Armin Hemmerling

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 253 - 270

Published online by Cambridge University Press: 23 March 2011

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

Calculi of net structures and sets are similar Calculi of net structures and sets are similar

false

preview

Abstract
Article Structure
Figures and Tables
References

Ludwik Czaja

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 271 - 284

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2007033 (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 weighted expressions conversion Efficient weighted expressions conversion

false

preview

Abstract
Article Structure
Figures and Tables
References

Faissal Ouardi and Djelloul Ziadi

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 285 - 307

Published online by Cambridge University Press: 23 March 2011

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

Census algorithms for chinese remainder pseudorank Census algorithms for chinese remainder pseudorank

false

preview

Abstract
Article Structure
Figures and Tables
References

David Laing and Bruce Litow

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 309 - 322

Published online by Cambridge University Press: 23 March 2011

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

Phenotype space and kinship assignment for the simpson index Phenotype space and kinship assignment for the simpson index

false

preview

Abstract
Article Structure
Figures and Tables
References

Bruce Litow and Dmitry Konovalov

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 323 - 333

Published online by Cambridge University Press: 23 March 2011

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

State complexity of cyclic shift State complexity of cyclic shift

false

preview

Abstract
Article Structure
Figures and Tables
References

Galina Jirásková and Alexander Okhotin

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 335 - 360

Published online by Cambridge University Press: 23 March 2011

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

D0L sequence equivalence is in P for fixed alphabets D0L sequence equivalence is in P for fixed alphabets

false

preview

Abstract
Article Structure
Figures and Tables
References

Keijo Ruohonen

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 361 - 374

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2007037 (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 morphic approach to combinatorial games: the Tribonacci case A morphic approach to combinatorial games: the Tribonacci case

false

preview

Abstract
Article Structure
Figures and Tables
References

Eric Duchêne and Michel Rigo

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 375 - 393

Published online by Cambridge University Press: 23 March 2011

DOI: http://dx.doi.org/10.1051/ita:2007039 (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 an algorithm to decide whether a free group is a free factor of another On an algorithm to decide whether a free group is a free factor of another

false

preview

Abstract
Article Structure
Figures and Tables
References

Pedro V. Silva and Pascal Weil

RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 02 / 2008, pp 395 - 414

Published online by Cambridge University Press: 23 March 2011

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

Welcome to Cambridge Journals Online

RAIRO - Theoretical Informatics and Applications

Research Articles