Volume 330,
Number 1,
January 2005
Insightful Theory
- Juhani Karhumäki, Grzegorz Rozenberg:
Preface: Insightful Theory.
1
- Dimitry S. Ananichev, Mikhail V. Volkov:
Synchronizing generalized monotonic automata.
3-13
- Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen:
Regular frequency computations.
15-21
- Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Mergible states in large NFA.
23-34
- Arturo Carpi, Aldo de Luca:
Completions in measure of languages and related combinatorial problems.
35-57
- Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun:
On two-way nondeterministic finite automata with one reversal-bounded counter.
59-79
- Cunsheng Ding, Xuesong Wang:
A coding theory construction of new systematic authentication codes.
81-99
- Rudolf Freund, Gheorghe Paun, Mario J. Pérez-Jiménez:
Tissue P systems with channel states.
101-116
- Tero Harju, Dirk Nowotka:
On the equation in a free semigroup.
117-121
- Juha Honkala:
The language equivalence problem for HD0L systems having D0L growths.
123-133
- Juraj Hromkovic, Georg Schnitger:
On the power of randomized multicounter machines.
135-144
- Yuri Matiyasevich, Géraud Sénizergues:
Decision problems for semi-Thue systems with a few rules.
145-169
- Keijo Ruohonen:
Explicit test sets for iterated morphisms in free monoids and metabelian groups.
171-191
Volume 330,
Number 2,
February 2005
Descriptional Complexity of Formal Systems
- Henning Bordihn:
On the number of components in cooperating distributed grammar systems.
195-204
- Juan Castellanos, Peter Leupold, Victor Mitrana:
On the size complexity of hybrid networks of evolutionary processors.
205-220
- Jean-Marc Champarnaud, Thomas Paranthoën:
Random generation of DFAs.
221-235
- Mark Daley, Ian McQuillan:
Template-guided DNA recombination.
237-250
- Rudolf Freund, Lila Kari, Marion Oswald, Petr Sosík:
Computationally universal P systems without priorities: two catalysts are sufficient.
251-266
- Markus Holzer, Martin Kutrib:
On the descriptional complexity of finite automata with modified acceptance conditions.
267-285
- Galina Jirásková:
State complexity of some operations on binary regular languages.
287-298
- Martin Kappes, Frank Nießner:
Succinct representations of languages by DFA with different levels of reliability.
299-310
- Martin Kutrib:
On the descriptional power of heads, counters, and pebbles.
311-324
- Andreas Malcher:
On two-way communication in cellular automata with a fixed number of cells.
325-338
- Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan:
Context-free insertion-deletion systems.
339-348
- Filippo Mera, Giovanni Pighizzini:
Complementing unary nondeterministic automata.
349-360
- György Vaszil:
On the descriptional complexity of some rewriting mechanisms regulated by context conditions.
361-373
Volume 330,
Number 3,
February 2005
Expressiveness in Concurrency
Copyright © Fri Mar 12 17:33:12 2010
by Michael Ley (ley@uni-trier.de)
