jalc.gif

Journal of Automata, Languages and Combinatorics

formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik

Otto-von-Guericke-Universität Magdeburg


VOLUME 17 2012 ALL NUMBERS

Search for Authors and/or Keywords:
Author(s):
Keywords:

M. P. BIANCHI, M. HOLZER, S. JAKOBI, C. MEREGHETTI, B. PALANO, G. PIGHIZZINI:
            On Inverse Operations and Their Descriptional Complexity.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 61–81.

U. BRANDT, H. K.-G. WALTER:
            On Testing Output Faults in the McCluskey Fault Model.
            Journal of Automata, Languages and Combinatorics 17 (2012) 1, 3–16.

J. BRZOZOWSKI, B. LI, D. LIU:
            Syntactic Complexities of Six Classes of Star-Free Languages.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 83–105.

C. CÂMPEANU:
            Randomness in Blum Universal Static Complexity Spaces.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 107–122.

J. DASSOW, R. HARBICH:
            Descriptional Complexity of Union and Star on Context-Free Languages.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 123–143.

J. DASSOW, M. KUTRIB, N. MOREIRA, R. REIS:
            Editorial.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 59–60.

J. DASSOW, F. MANEA, B. TRUTHE:
            On Subregular Selection Languages in Internal Contextual Grammars.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 145–164.

R. HARBICH, B. TRUTHE:
            A Comparison of the Descriptional Complexity of Classes of Limited Lindenmayer Systems.
            Journal of Automata, Languages and Combinatorics 17 (2012) 1, 17–56.

M. HOLZER, S. JAKOBI:
            Descriptional Complexity of Chop Operations on Unary and Finite Languages.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 165–183.

J.-B. JEANNIN, D. KOZEN:
            Computing with Capsules.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 185–204.

C. A. KAPOUTSIS:
            Minicomplexity.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 205–224.

A. MALCHER, K. MECKEL, C. MEREGEHETTI, B. PALANO:
            Descriptional Complexity of Pushdown Store Languages.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 225–244.

A. PALIOUDAKIS, K. SALOMAA, S. G. AKL:
            State Complexity of Finite Tree Width NFAs.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 245–264.

A. PLATZER:
            Logical Analysis of Hybrid Systems: A Answer to a Complexity Challenge.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 265–275.

P. V. SILVA:
            Groups and Automata: a Perfect Match.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 277–292.

K. SUTNER, K. LEWI:
            Iterating Inverse Binary Transducers.
            Journal of Automata, Languages and Combinatorics 17 (2012) 2–4, 293–313.


Homepage