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 14 2009 ALL NUMBERS

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

A. BERNINI, L. FERRARI, R. PINZANI:
            Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three.
            Journal of Automata, Languages and Combinatorics 14 (2009) 2, 129–147.

H. BORDIHN, B. SUNCKEL:
            Descriptional Complexity of Restricted CD Grammar Systems.
            Journal of Automata, Languages and Combinatorics 14 (2009) 1, 7–22.

O. CARTON, J.-E. PIN, X. SOLER-ESCRIVÀ:
            Languages Recognized by Finite Supersoluble Groups.
            Journal of Automata, Languages and Combinatorics 14 (2009) 2, 149–161.

J. DASSOW, A. MALCHER:
            Editorial.
            Journal of Automata, Languages and Combinatorics 14 (2009) 1, 5–6.

J. HROMKOVIC, G. SCHNITGER:
            Lower Bounds on the Size of Sweeping Automata.
            Journal of Automata, Languages and Combinatorics 14 (2009) 1, 23–31.

M. HUOVA:
            A Note on Defect Theorems for 2-Dimensional Words and Trees.
            Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 203–209.

H. JÜRGENSEN:
            Markers and Deterministic Acceptors for Non-Deterministic Languages.
            Journal of Automata, Languages and Combinatorics 14 (2009) 1, 33–62.

C. M. KINTALA:
            Software Rejuvenation in Embedded Systems.
            Journal of Automata, Languages and Combinatorics 14 (2009) 1, 63–73.

A. KLEIN, M. KUTRIB:
            Self-Assembling Finite Automata.
            Journal of Automata, Languages and Combinatorics 14 (2009) 1, 75–92.

H. LEUNG:
            A Technique for Proving Lower Bounds on the Size of Sweeping Automata.
            Journal of Automata, Languages and Combinatorics 14 (2009) 1, 93–105.

N. LIMAYE, M. MAHAJAN, A. MEYER:
            On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.
            Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 211–235.

T. MANSOUR, A. O. MUNAGI:
            Enumeration of Gap-Bounded Set Partitions.
            Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 237–245.

B. NAGY:
            Languages Generated by Context-Free Grammars Extended by Type AB to BA Rules.
            Journal of Automata, Languages and Combinatorics 14 (2009) 2, 175–186.

T. Y. NISHIDA:
            An Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity.
            Journal of Automata, Languages and Combinatorics 14 (2009) 2, 187–198.

G. PIGHIZZINI:
            Nondeterministic One-Tape Off-Line Turing Machines.
            Journal of Automata, Languages and Combinatorics 14 (2009) 1, 107–124.

K. RUOHNEN:
            Equivalence of Set- and Bag-Valued Orbits.
            Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 247–253.

A. SAARELA:
            Ultimately Constant Abelian Complexity of Infinite Words.
            Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 255–258.

A. CERNY:
            On Fair Words.
            Journal of Automata, Languages and Combinatorics 14 (2009) 2, 163–174.

Z. WANG, F. LIANG, Y. HE, D. YANG:
            Semiring Structures of some Classes of Hypercodes.
            Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 259–272.

D. WÄTJEN:
            Multi-limited Simple Eco-Grammar Systems with Prescribed Teams.
            Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 273–296.


Homepage