Volume 116, Numbers 1-4, 2012
- Vesa Halava, Juhani Karhumäki, Dirk Nowotka, Grzegorz Rozenberg:
Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju.
- Paul C. Bell, Igor Potapov:
On the Computational Complexity of Matrix Semigroup Problems.
1-13
- Robert Brijder, Hendrik Jan Hoogeboom:
Binary Symmetric Matrix Inversion Through Local Complementation.
15-23
- Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni:
Some Characterizations of Sturmian Words in Terms of the Lexicographic Order.
25-33
- Giusi Castiglione, Antonio Restivo:
On the Shuffle of Star-Free Languages.
35-44
- Christian Choffrut:
A Note on the Logical Definability of Rational Trace Languages.
45-50
- Elena Czeizler, Andrzej Mizera, Ion Petre:
A Boolean Approach for Disentangling the Roles of Submodules to the Global Properties of a Biomodel.
51-63
- Volker Diekert, Manfred Kufleitner, Benjamin Steinberg:
The Krohn-Rhodes Theorem and Local Divisors.
65-77
- Yuan Gao, Sheng Yu:
State Complexity of Combined Operations with Union, Intersection, Star and Reversal.
79-92
- Nikita Gogin, Mika Hirvensalo:
Recurrent Construction of MacWilliams and Chebyshev Matrices.
93-110
- Jurriaan Hage:
Subgroup Switching of Skew Gain Graphs.
111-122
- Juha Honkala:
A Characterization of Regular Languages as Equality Sets of HDT0L Sequences.
123-128
- Oscar H. Ibarra, Ömer Egecioglu:
A Survey of Results on Stateless Multicounter Automata.
129-140
- Jarkko Kari, Bastien Le Gloannec:
Modified Traffic Cellular Automaton for the Density Classification Task.
141-156
- Tomi Kärki:
Repetition-freeness with Cyclic Relations and Chain Relations.
157-174
- Anne Lacroix, Narad Rampersad, Michel Rigo, Élise Vandomme:
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure.
175-187
- Michel Latteux, Yves Roos:
On One-Rule Grid Semi-Thue Systems.
189-204
- Alexander Okhotin:
Language Equations with Symmetric Difference.
205-222
- Narad Rampersad, Jeffrey Shallit, Zhi Xu:
The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages.
223-236
- Arto Salomaa:
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism.
237-249
- Patrice Séébold:
Length-k-overlap-free Binary Infinite Words.
251-263
Last update Mon May 20 00:58:06 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
