Informatique Théorique et Applications, Volume 43, 2009
Volume 43, Number 1, January-March 2009
- Dalia Krieger: On Critical exponents in fixed points of k-uniform binary morphisms. 41-68
- Andrew Badr, Viliam Geffert, Ian Shipman: Hyper-minimizing minimized deterministic finite state automata. 69-94
- Victor L. Selivanov: Hierarchies and reducibilities on regular languages related to modulo counting. 95-132
- Lubomíra Balková, Zuzana Masáková: Palindromic complexity of infinite words associated with non-simple Parry numbers. 145-163
Volume 43, Number 2, April-June 2009
- Dirk Leinders, Jan Van den Bussche: Repetitions and permutations of columns in the semijoin algebra. 179-187
- Tobias Mömke: On the power of randomization for job shop scheduling with k-units length tasks. 189-207
- Eduardo C. Xavier, Flávio Keidi Miyazawa: A note on dual approximation algorithms for class constrained bin packing problems. 239-248
- Thuy Duong Vu: Thread algebra for noninterference. 249-268
- Arseny M. Shur: Polynomial languages with finite antidictionaries. 269-279
- Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre: Efficient validation and construction of border arrays and validation of string matching automata. 281-297
- Amy Glen, Florence Levé, Gwénaël Richomme: Directive words of episturmian words: equivalences and normalization. 299-319
- Véronique Bruyère, Olivier Carton, Géraud Sénizergues: Tree Automata and Automata on Linear Orderings. 321-338
- Olivier Finkel: Highly Undecidable Problems For Infinite Computations. 339-364
- Tomás Masopust, Alexander Meduna: On context-free rewriting with a simple restriction and its computational completeness. 365-378
Volume 43, Number 3, July-September 2009
- Jérémie Cabessa, Jacques Duparc: A game theoretical approach to the algebraic counterpart of the Wagner hierarchy: Part I. 443-461
- Jérémie Cabessa, Jacques Duparc: A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy: Part II. 463-515
- Lorenzo Bettini, Sara Capecchi, Betti Venneri: Dynamic overloading with copy semantics in object-oriented languages: a formal account. 517-565
- Phillip G. Bradford, David A. Thomas: Labeled shortest paths in digraphs with negative and positive edge weights. 567-583
- Stefan Dobrev, Rastislav Královic, Dana Pardubská: Measuring the problem-relevant information in input. 585-613
- Arturas Dubickas: Squares and cubes in Sturmian sequences. 615-624
- Frédérique Carrère: Inductive computations on graphs defined by clique-width expressions. 625-651
- Friedrich Otto: Left-to-right regular languages and two-way restarting automata. 653-665
Volume 43, Number 4, October-December 2009
- Favio E. Miranda-Perea: Two extensions of system ${\mathsf F}$ with (co)iteration and primitive (co)recursion principles. 703-766
- Francine Blanchet-Sadri, Robert Mercas: A note on the number of squares in a partial word with one hole. 767-774
- Rafael C. Carrasco, Jan Daciuk: A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata. 779-790
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team