Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 43
Volume 43, Number 1, January-March 2009
- Eugénie Foustoucos, Irène Guessarian:
Inf-datalog, Modal Logic and Complexities. 1-21 - Francine Blanchet-Sadri, D. Dakota Blair
, Rebeca V. Lewis:
Equations on partial words. 23-39 - 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 - Tsong-Jie Lin, Sun-Yuan Hsieh, Hui-Ling Huang:
Cycle and Path Embedding on 5-ary N-cubes. 133-144 - L'ubomíra Balková, Zuzana Masáková:
Palindromic complexity of infinite words associated with non-simple Parry numbers. 145-163 - James D. Currie, Kalle Saari:
Least Periods of Factors of Infinite Words. 165-178
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 - Vesa Halava, Tero Harju, Tomi Kärki:
The theorem of Fine and Wilf for relational periods. 209-220 - Michel Latteux, Yves Roos, Alain Terlutte:
Minimal NFA and biRFSA Languages. 221-237 - 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 - Françoise Gire, Jean-Marc Talbot:
Nested Sibling Tree Automata. 379-402
Volume 43, Number 3, July-September 2009
- Amy Glen, Jacques Justin:
Episturmian words: a survey. 403-442 - 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
- Carme Àlvarez, Maria J. Serna:
On the proper intervalization of colored caterpillar trees. 667-686 - L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Palindromes in infinite ternary words. 687-702 - Favio Ezequiel 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 - James D. Currie, Narad Rampersad:
Dejean's conjecture holds for $\sf {N\ge 27}$. 775-778 - Rafael C. Carrasco, Jan Daciuk:
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata. 779-790
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-13 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
