15 (2010) 1/2
Special Issue:
Selected Papers of the
11th Workshop on
Descriptional Complexity of Formal Systems
(Magdeburg, Germany, July 6 – 9, 2009)
J. DASSOW, G. PIGHIZZINI, B. TRUTHE:
Editorial.
Journal of Automata, Languages and
Combinatorics 15 (2010) 1/2, 5–5.
-
M. ALMEIDA, N. MOREIRA, R. REIS:
Testing the Equivalence of Regular
Languages.
Journal of Automata, Languages and
Combinatorics 15 (2010) 1/2, 7–25.
-
P.-Y. ANGRAND, S. LOMBARDY,
J. SAKAROVITCH:
On the Number of Broken Derived Terms of a Rational Expression.
Journal of Automata, Languages and Combinatorics 15
(2010) 1/2, 27–51.
-
F. BIEGLER, M. DALEY, I. MCQUILLAN:
On the
Shuffle Automaton Size for Words.
Journal of Automata,
Languages and Combinatorics 15 (2010) 1/2, 53–70.
-
J. BRZOZOWSKI:
Quotient Complexity of Regular Languages.
Journal
of Automata, Languages and Combinatorics 15 (2010) 1/2,
71–89.
-
E. CSUHAJ-VARJÚ, G. VASZIL:
On the Descriptional Complexity of
Context-Free Non-returning PC Grammar Systems.
Journal
of Automata, Languages and Combinatorics 15 (2010) 1/2,
91–105.
-
H. GRUBER, M. HOLZER, M. KUTRIB:
On Measuring Non-recursive
Trade-Offs.
Journal of Automata, Languages and
Combinatorics 15 (2010) 1/2, 107–120.
-
G. JIRÁSKOVÁ, A. OKHOTIN:
Nondeterministic State Complexity of Positional Addition.
Journal of Automata, Languages and Combinatorics 15 (2010)
1/2, 121–133.
-
M. KUTRIB, A. MALCHER:
One-Way
Cellular Automata, Bounded Languages, and Minimal Communication.
Journal of Automata, Languages and Combinatorics 15
(2010) 1/2, 135–153.
-
R. LOOS, F. MANEA, V. MITRANA:
Small Universal Accepting Networks
of Evolutionary Processors with Filtered Connections.
Journal of Automata, Languages and Combinatorics 15 (2010) 1/2,
155–174.
-
R. STIEBE, S. TURAEV:
Capacity-Bounded Grammars.
Journal of Automata,
Languages and Combinatorics 15 (2010) 1/2, 175–194.
|
