default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 39
Volume 39, Number 1, January-March 2005
- Christian Choffrut, Yoshiko Wakabayashi
:
Preface. - Jorge Almeida, Ana Paula Escada:
The globals of pseudovarieties of ordered semigroups containing B2 and an application to a problem proposed by Pin. 1-29 - Jorge Almeida, Stuart W. Margolis, Mikhail V. Volkov:
The pseudovariety of semigroups of triangular matrices over a finite field. 31-48 - József Balogh, Béla Bollobás:
Hereditary properties of words. 49-65 - Janusz A. Brzozowski, Mihaela Gheorghiu:
Gate circuits in the algebra of transients. 67-91 - Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
On the number of dissimilar pfaffian orientations of graphs. 93-113 - Jean-Marc Champarnaud, Franck Guingne, Georges Hansel:
Similarity relations and cover automata. 115-123 - Christian Choffrut, Juhani Karhumäki:
Some decision problems on integer matrices. 125-131 - Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein:
Finding H-partitions efficiently. 133-144 - Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
The perfection and recognition of bull-reducible Berge graphs. 145-160 - Aldo de Luca:
Some decompositions of Bernoulli sets and codes. 161-174 - Alair Pereira do Lago, Ilya B. Muchnik, Casimir A. Kulikowski:
A sparse dynamic programming algorithm for alignment with non-overlapping inversions. 175-189 - Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa:
A note on the Size-Ramsey number of long subdivisions of graphs. 191-206 - Jacques Justin:
Episturmian morphisms and a Galois theorem on continued fractions. 207-215 - Sylvain Lombardy, Jacques Sakarovitch:
How expressions can code for automata. 217-237 - Jean-Eric Pin, Howard Straubing:
Some results on C-varieties. 239-262 - Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Parity codes. 263-278 - John Rhodes, Benjamin Steinberg:
Krohn-Rhodes complexity pseudovarieties are not finitely based. 279-296 - Denis Thérien:
Imre Simon: an exceptional graduate student. 297-304 - Zoltán Ésik, Zoltán L. Németh:
Algebraic and graph-theoretic properties of infinite n-posets. 305-322
Volume 39, Number 2, April-June 2005
- Frantisek Mráz, Friedrich Otto:
Hierarchies of weakly monotone restarting automata. 325-342 - Petra Kocábová, Zuzana Masáková, Edita Pelantová:
Integers with a maximal number of Fibonacci representations. 343-359 - Jean-Yves Lafaye, Georges Louis:
A metric for evaluating software architecture and communication models consistency. 361-390 - Markus Lohrey, Holger Petersen:
Complexity results for prefix grammars. 391-401 - Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
Efficient simulation of synchronous systems by multi-speed systems. 403-419
Volume 39, Number 3, July-September 2005
- Igor Walukiewicz:
Preface. 421-422 - Andrzej Filinski, Henning Korsholm Rohde:
Denotational aspects of untyped normalization by evaluation. 423-453 - Daniel Kirsten:
Distance desert automata and the star height problem. 455-509 - Stephen Lack, Pawel Sobocinski:
Adhesive and quasiadhesive categories. 511-545 - Salvador Lucas:
Polynomials over the reals in proofs of termination: from theory to practice. 547-586 - Gerald Lüttgen, Walter Vogler:
Bisimulation on speed: Lower time bounds. 587-618
Volume 39, Number 4, October-December 2005
- Ludwig Staiger:
The entropy of Lukasiewicz-languages. 621-639 - Klaus Thomsen:
Languages of finite words occurring infinitely many times in an infinite word. 641-650 - Sébastien Orange, Guénaël Renault, Annick Valibouze:
Note sur les relations entre les racines d'un polynéme réductible (Text in French). 651-659 - Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Equality sets for recursively enumerable languages. 661-675 - Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher:
On maximal QROBDD's of Boolean functions. 677-686 - Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-way communication complexity of symmetric Boolean functions. 687-706
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-11-08 20:37 CET 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:
