Recent articles in RAIRO - Theoretical Informatics and Applications

Recent articles in RAIRO - Theoretical Informatics and Applications http://www.edpsciences.org/ita Contents of the last issue of RAIRO - Theoretical Informatics and Applications weekly 1 2008-06-04T14:05:36Z EDP Sciences Copyright (c) 2008 Copyright (c) 2008 1290-385X RAIRO - Theoretical Informatics and Applications Repetitions and permutations of columns in the semijoin algebra http://www.edpsciences.org/10.1051/ita:2008023 Authors: Dirk Leinders and Jan Van Den Bussche RAIRO-Theor. Inf. Appl. PREPRINT, (2008) Received August 21, 2006. Accepted April 3, 2008. Keywords: Database, relational algebra, semijoin algebra, projection. Repetitions and permutations of columns in the semijoin algebra Dirk Leinders Jan Van Den Bussche Database relational algebra semijoin algebra projection. 68P15 2008-06-04T14:05:36Z text/html doi:10.1051/ita:2008023 RAIRO-Theor. Inf. Appl. PREPRINT, abstract 1212588336 RAIRO - Theoretical Informatics and Applications Article PREPRINT On the power of randomization for job shop scheduling with k-units length tasks http://www.edpsciences.org/10.1051/ita:2008024 Author: Tobias Mömke RAIRO-Theor. Inf. Appl. PREPRINT, (2008) Received August 28, 2007. Accepted April 24, 2008. Keywords: On-line algorithms, randomization, competitive ratio, scheduling On the power of randomization for job shop scheduling with k-units length tasks Tobias Mömke On-line algorithms randomization competitive ratio scheduling 68W20 68W25 2008-06-04T14:05:36Z text/html doi:10.1051/ita:2008024 RAIRO-Theor. Inf. Appl. PREPRINT, abstract 1212588336 RAIRO - Theoretical Informatics and Applications Article PREPRINT The theorem of Fine and Wilf for relational periods http://www.edpsciences.org/10.1051/ita:2008025 Authors: Vesa Halava, Tero Harju and Tomi Kärki RAIRO-Theor. Inf. Appl. PREPRINT, (2008) Received April 18, 2007. Accepted April 29, 2008. Keywords: Period, partial word, compatibility, Fine, Wilf. The theorem of Fine and Wilf for relational periods Vesa Halava Tero Harju Tomi Kärki Period partial word compatibility Fine Wilf. 68R15 2008-06-04T14:05:36Z text/html doi:10.1051/ita:2008025 RAIRO-Theor. Inf. Appl. PREPRINT, abstract 1212588336 RAIRO - Theoretical Informatics and Applications Article PREPRINT Editorial: Preface http://www.edpsciences.org/10.1051/ita:2008007 Authors: Didier Caucal and Anne Siegel RAIRO-Theor. Inf. Appl. 42, 415 (2008) Editorial: Preface Didier Caucal Anne Siegel 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008007 RAIRO-Theor. Inf. Appl. 42, 415 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Editorial 415 42 A Hierarchy of Automatic \omega-Words having a Decidable MSO Theory http://www.edpsciences.org/10.1051/ita:2008008 Author: Vince Bárány RAIRO-Theor. Inf. Appl. 42, 417 (2008) Keywords: Morphic words, monadic second-order logic, automatic structures, automatic sequences. A Hierarchy of Automatic \omega-Words having a Decidable MSO Theory Vince Bárány Morphic words monadic second-order logic automatic structures automatic sequences. 03D05 68Q42 68Q45 68R15 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008008 RAIRO-Theor. Inf. Appl. 42, 417 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 417 42 Some Algebraic Properties of Machine Poset of Infinite Words http://www.edpsciences.org/10.1051/ita:2008009 Author: Aleksandrs Belovs RAIRO-Theor. Inf. Appl. 42, 451 (2008) Keywords: Infinite words, Mealy machine, poset, algebraic properties. Some Algebraic Properties of Machine Poset of Infinite Words Aleksandrs Belovs Infinite words Mealy machine poset algebraic properties. 03D40 20F10 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008009 RAIRO-Theor. Inf. Appl. 42, 451 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 451 42 From Bi-ideals to Periodicity http://www.edpsciences.org/10.1051/ita:2008010 Authors: Jānis Buls and Aivars Lorencs RAIRO-Theor. Inf. Appl. 42, 467 (2008) Keywords: Periodic words, bi-ideals, the sequence generates the bi-ideal, finitely generated bi-ideals From Bi-ideals to Periodicity Jānis Buls Aivars Lorencs Periodic words bi-ideals the sequence generates the bi-ideal finitely generated bi-ideals 68R15 94A55 68Q15 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008010 RAIRO-Theor. Inf. Appl. 42, 467 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 467 42 Parikh test sets for commutative languages http://www.edpsciences.org/10.1051/ita:2008011 Author: Štěpán Holub RAIRO-Theor. Inf. Appl. 42, 525 (2008) Keywords: Combinatorics on words, test sets, commutative languages. Parikh test sets for commutative languages Štěpán Holub Combinatorics on words test sets commutative languages. 68R15 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008011 RAIRO-Theor. Inf. Appl. 42, 525 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 525 42 Drunken man infinite words complexity http://www.edpsciences.org/10.1051/ita:2008012 Author: Marion Le Gonidec RAIRO-Theor. Inf. Appl. 42, 599 (2008) Drunken man infinite words complexity Marion Le Gonidec 11B85 68R15 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008012 RAIRO-Theor. Inf. Appl. 42, 599 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 599 42 Dejean's conjecture and letter frequency http://www.edpsciences.org/10.1051/ita:2008013 Authors: Jérémie Chalopin and Pascal Ochem RAIRO-Theor. Inf. Appl. 42, 477 (2008) Dejean's conjecture and letter frequency Jérémie Chalopin Pascal Ochem 68R15 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008013 RAIRO-Theor. Inf. Appl. 42, 477 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 477 42 An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid http://www.edpsciences.org/10.1051/ita:2008014 Authors: Laura Giambruno and Antonio Restivo RAIRO-Theor. Inf. Appl. 42, 503 (2008) Keywords: Automata, free monoids, rank, intersection of submonoids An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid Laura Giambruno Antonio Restivo Automata free monoids rank intersection of submonoids 68Q70 68Q45 20M35 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008014 RAIRO-Theor. Inf. Appl. 42, 503 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 503 42 A new algebraic invariant for weak equivalence of sofic subshifts http://www.edpsciences.org/10.1051/ita:2008015 Authors: Laura Chaubard and Alfredo Costa RAIRO-Theor. Inf. Appl. 42, 481 (2008) Keywords: Sofic subshift, conjugacy, weak equivalence, \zeta-semigroup, pseudovariety. A new algebraic invariant for weak equivalence of sofic subshifts Laura Chaubard Alfredo Costa Sofic subshift conjugacy weak equivalence \zeta-semigroup pseudovariety. 20M07 37B10 20M35 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008015 RAIRO-Theor. Inf. Appl. 42, 481 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 481 42 Compatibility relations on codes and free monoids http://www.edpsciences.org/10.1051/ita:2008016 Author: Tomi Kärki RAIRO-Theor. Inf. Appl. 42, 539 (2008) Keywords: Compatibility relation, free monoid, stability, defect theorem, partial word. Compatibility relations on codes and free monoids Tomi Kärki Compatibility relation free monoid stability defect theorem partial word. 68R15 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008016 RAIRO-Theor. Inf. Appl. 42, 539 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 539 42 A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata http://www.edpsciences.org/10.1051/ita:2008017 Author: Daniel Kirsten RAIRO-Theor. Inf. Appl. 42, 553 (2008) Keywords: Weighted automata, tropical semiring, determinization. A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata Daniel Kirsten Weighted automata tropical semiring determinization. 68Q45 68Q70 20M35. 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008017 RAIRO-Theor. Inf. Appl. 42, 553 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 553 42 Traces of term-automatic graphs http://www.edpsciences.org/10.1051/ita:2008018 Author: Antoine Meyer RAIRO-Theor. Inf. Appl. 42, 615 (2008) Keywords: Languages, infinite automata, terms, tiling systems, complexity. Traces of term-automatic graphs Antoine Meyer Languages infinite automata terms tiling systems complexity. 68Q45 68Q05 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008018 RAIRO-Theor. Inf. Appl. 42, 615 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 615 42 Two sided Sand Piles Model and unimodal sequences http://www.edpsciences.org/10.1051/ita:2008019 Author: Thi Ha Duong PHAN RAIRO-Theor. Inf. Appl. 42, 631 (2008) Keywords: Discrete dynamical system, Sand Piles Model, partition, unimodal sequence, order, lattice, dominance ordering, fixed point. Two sided Sand Piles Model and unimodal sequences Thi Ha Duong PHAN Discrete dynamical system Sand Piles Model partition unimodal sequence order lattice dominance ordering fixed point. 68R05 05A17 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008019 RAIRO-Theor. Inf. Appl. 42, 631 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 631 42 On Varieties of Literally Idempotent Languages http://www.edpsciences.org/10.1051/ita:2008020 Authors: Ondřej Klíma and Libor Polák RAIRO-Theor. Inf. Appl. 42, 583 (2008) Keywords: Literally idempotent languages, varieties of languages. On Varieties of Literally Idempotent Languages Ondřej Klíma Libor Polák Literally idempotent languages varieties of languages. 68Q45 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008020 RAIRO-Theor. Inf. Appl. 42, 583 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 583 42 Comparing Complexity Functions of a Language and Its Extendable Part http://www.edpsciences.org/10.1051/ita:2008021 Author: Arseny M. Shur RAIRO-Theor. Inf. Appl. 42, 647 (2008) Comparing Complexity Functions of a Language and Its Extendable Part Arseny M. Shur 68Q70 68R15 2008-06-02T10:27:46Z text/html doi:10.1051/ita:2008021 RAIRO-Theor. Inf. Appl. 42, 647 abstract 3 1212402466 RAIRO - Theoretical Informatics and Applications Article 647 42 Minimal NFA and biRFSA Languages http://www.edpsciences.org/10.1051/ita:2008022 Authors: Michel Latteux, Yves Roos and Alain Terlutte RAIRO-Theor. Inf. Appl. PREPRINT, (2008) Received June 1st, 2006. Accepted February 25, 2008. Keyword: Residual finite state automata; minimal NFA Minimal NFA and biRFSA Languages Michel Latteux Yves Roos Alain Terlutte Residual finite state automata; minimal NFA 68Q45. 2008-05-22T12:09:05Z text/html doi:10.1051/ita:2008022 RAIRO-Theor. Inf. Appl. PREPRINT, abstract 1211458145 RAIRO - Theoretical Informatics and Applications Article PREPRINT