Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 42
Volume 42, Number 1, January-March 2008
- Christian Choffrut, Loïc Colson:
Preface. 1-4 - Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich
:
Tree inclusion problems. 5-20 - Maurice Margenstern:
About the domino problem in the hyperbolic plane from an algorithmic point of view. 21-36 - Marianne Delorme, Jacques Mazoyer:
Exemples de classes d'automates cellulaires. 37-53 - Jean-Baptiste Yunès:
An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem. 55-68 - Pierre Valarcher:
A complete characterization of primitive recursive intensional behaviours. 69-82 - Maurice Pouzet:
When is the orbit algebra of a group an integral domain? Proof of a conjecture of P.J. Cameron. 83-103 - Sedki Boughattas, Jean-Pierre Ressayre:
Arithmetization of the field of reals with exponentiation extended abstract. 105-119 - Christian Choffrut:
Deciding whether a relation defined in Presburger logic can be defined in weaker logics. 121-135 - Alexis Bès, Patrick Cégielski:
Weakly maximal decidable structures. 137-145 - Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive:
Computing the jth solution of a first-order query. 147-164 - Jérôme Besombes, Jean-Yves Marion:
Learning discrete categorial grammars from structures. 165-182 - Olivier Carton, Olivier Finkel, Pierre Simonnet:
On the continuity set of an Omega rational function. 183-196
Volume 42, Number 2, April-June 2008
- Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier:
Efficiency of automata in semi-commutation verification techniques. 197-215 - Juhani Karhumäki, Jarkko Kari, Joachim Kupke:
Binary operations on automatic functions. 217-236 - Maria J. Serna, Fatos Xhafa:
Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming. 237-252 - Armin Hemmerling:
Hierarchies of function classes defined by the first-value operator. 253-270 - Ludwik Czaja:
Calculi of net structures and sets are similar. 271-284 - Faissal Ouardi, Djelloul Ziadi:
Efficient weighted expressions conversion. 285-307 - David Laing, Bruce E. Litow:
Census algorithms for chinese remainder pseudorank. 309-322 - Bruce E. Litow, Dmitry A. Konovalov:
Phenotype space and kinship assignment for the simpson index. 323-333 - Galina Jirásková, Alexander Okhotin:
State complexity of cyclic shift. 335-360 - Keijo Ruohonen:
D0L sequence equivalence is in P for fixed alphabets. 361-374 - Éric Duchêne, Michel Rigo:
A morphic approach to combinatorial games: the Tribonacci case. 375-393 - Pedro V. Silva, Pascal Weil:
On an algorithm to decide whether a free group is a free factor of another. 395-414
Volume 42, Number 3, July-September 2008
- Didier Caucal, Anne Siegel:
Preface. 415 - Vince Bárány:
A Hierarchy of Automatic $\omega$-Words having a Decidable MSO Theory. 417-450 - Aleksandrs Belovs:
Some Algebraic Properties of Machine Poset of Infinite Words. 451-466 - Janis Buls, Aivars Lorencs:
From Bi-ideals to Periodicity. 467-475 - Jérémie Chalopin, Pascal Ochem:
Dejean's conjecture and letter frequency. 477-480 - Laura Chaubard, Alfredo Costa:
A new algebraic invariant for weak equivalence of sofic subshifts. 481-502 - Laura Giambruno, Antonio Restivo:
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid. 503-524 - Stepan Holub:
Parikh test sets for commutative languages. 525-537 - Tomi Kärki:
Compatibility relations on codes and free monoids. 539-552 - Daniel Kirsten:
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata. 553-581 - Ondrej Klíma, Libor Polák:
On Varieties of Literally Idempotent Languages. 583-598 - Marion Le Gonidec:
Drunken man infinite words complexity. 599-613 - Antoine Meyer:
Traces of term-automatic graphs. 615-630 - Thi Ha Duong Phan:
Two sided Sand Piles Model and unimodal sequences. 631-646 - Arseny M. Shur:
Comparing Complexity Functions of a Language and Its Extendable Part. 647-655
Volume 42, Number 4, October-December 2008
- Jean Berstel, Tero Harju, Juhani Karhumäki:
Preface. 657 - Jean-Paul Allouche:
A note on univoque self-Sturmian numbers. 659-662 - Julien Bernat:
Study of irreducible balanced pairs for substitutive languages. 663-678 - Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni:
On some problems related to palindrome closure. 679-700 - Julien Cassaigne:
On extremal properties of the Fibonacci word. 701-715 - Giuseppe Pirillo:
A hierarchy for circular codes. 717-728 - Patrice Séébold:
Look and Say Fibonacci. 729-746 - Bo Tan, Zhi-Ying Wen:
Periodicity Problem of Substitutions over Ternary Alphabets. 747-762
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-04-22 20:03 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:
