RAIRO - Theoretical Informatics and Applications
Volume 42 / No 3 (July-September 2008)
JM'06
A Hierarchy of Automatic ω-Words having a Decidable MSO Theory p. 417
Published online: 03 June 2008
Some Algebraic Properties of Machine Poset of Infinite Words p. 451
Published online: 03 June 2008
From Bi-ideals to Periodicity p. 467
Published online: 03 June 2008
Dejean's conjecture and letter frequency p. 477
Published online: 03 June 2008
A new algebraic invariant for weak equivalence of sofic subshifts p. 481
Published online: 03 June 2008
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid p. 503
Published online: 03 June 2008
Parikh test sets for commutative languages p. 525
Published online: 03 June 2008
Compatibility relations on codes and free monoids p. 539
Published online: 03 June 2008
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata p. 553
Published online: 03 June 2008
On Varieties of Literally Idempotent Languages p. 583
Published online: 03 June 2008
Drunken man infinite words complexity p. 599
Published online: 03 June 2008
Traces of term-automatic graphs p. 615
Published online: 03 June 2008
Two sided Sand Piles Model and unimodal sequences p. 631
Published online: 03 June 2008
Comparing Complexity Functions of a Language and Its Extendable Part p. 647
Published online: 03 June 2008