Volume 356, Numbers 1-2, May 2006

• 
  Professor Choffrut.

• 
  Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki: Preface. 1-5

• 
  Marie-Pierre Béal, Dominique Perrin: Codes, unambiguous automata and sofic systems. 6-13
• 
  Alberto Bertoni, Carlo Mereghetti, Beatrice Palano: Some formal tools for analyzing quantum automata. 14-25
• 
  Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg: Reducibility of gene patterns in ciliates using the breakpoint graph. 26-45
• 
  Janusz A. Brzozowski: Representation of a class of nondeterministic semiautomata by canonical words. 46-57
• 
  Giusi Castiglione, Antonio Restivo, Roberto Vaglica: A reconstruction algorithm for L-convex polyominoes. 58-72
• 
  Laura Chaubard, Jean-Eric Pin, Howard Straubing: Actions, wreath products of C-varieties and concatenation product. 73-89
• 
  Alessandra Cherubini, Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro: Picture languages: Tiling systems versus tile rewriting grammars. 90-103
• 
  Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio: On the structure of the counting function of sparse context-free languages. 104-117
• 
  Aldo de Luca, Alessandro De Luca: Some characterizations of finite Sturmian words. 118-125
• 
  Volker Diekert, Paul Gastin: From local to global temporal logics over Mazurkiewicz traces. 126-135
• 
  Zoltán Ésik: Characterizing CTL-like logics on finite trees. 136-152
• 
  Massimiliano Goldwurm, Violetta Lonati: Pattern statistics and Vandermonde matrices. 153-169
• 
  Serge Grigorieff: Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(log_m D). 170-185
• 
  Tero Harju, Dirk Nowotka: On unique factorizations of primitive words. 186-189
• 
  Oscar H. Ibarra, Bala Ravikumar: On partially blind multihead finite automata. 190-199
• 
  Juhani Karhumäki, Michal Kunc, Alexander Okhotin: Computing by commuting. 200-211
• 
  Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte: Identification of biRFSA languages. 212-223
• 
  Sylvain Lombardy, Jacques Sakarovitch: Sequential? 224-244
• 
  Jean Neraud: Completing prefix codes in submonoids. 245-254
• 
  Wieslaw Zielonka: Time-stamps for Mazurkiewicz traces. 255-262

Volume 356, Number 3, May 2006

• 
  Jos C. M. Baeten, Flavio Corradini: Preface. 263-264

• 
  Rob J. van Glabbeek: On the expressiveness of higher dimensional automata. 265-290
• 
  Flavio Corradini, Maria Rita Di Berardini, Walter Vogler: Fairness of components in system computations. 291-324
• 
  Suzana Andova, Tim A. C. Willemse: Branching bisimulation for probabilistic systems: Characteristics and decidability. 325-355
• 
  Emmanuel Beffara, François Maurel: Concurrent nets: A study of prefixing in process calculi. 356-373
• 
  Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: On the omega-language expressive power of extended Petri nets. 374-386
• 
  Rocco De Nicola, Daniele Gorla, Rosario Pugliese: On the expressive power of KLAIM-based calculi. 387-421
• 
  Mikkel Bundgaard, Thomas T. Hildebrandt, Jens Chr. Godskesen: A CPS encoding of name-passing in Higher-order mobile embedded resources. 422-439
• 
  Xudong Guan: Name-passing in an ambient-like calculus and its proof using spatial logic. 440-467
• 
  Iain Phillips, Maria Grazia Vigliotti: Leader election in rings of ambient processes. 468-494

last updated on Sat May 25 06:44:46 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page