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 1 1996 ALL NUMBERS

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

1 (1996) 1

P. J. GRABNER, H. PRODINGER:
            On the Optimality of an Algorithm of Reingold and Supowit.
            Journal of Automata, Languages and Combinatorics 1 (1996) 1, 5–11.

L. KARI, G. THIERRIN:
            Omega-Syntactic Congruences.
            Journal of Automata, Languages and Combinatorics 1 (1996) 1, 13–26.

G. PĂUN:
            Regular Extended H Systems are Computationally Universal.
            Journal of Automata, Languages and Combinatorics 1 (1996) 1, 27–36.

K. SALOMAA:
            On the Modularity of Decidability of Completeness and Termination.
            Journal of Automata, Languages and Combinatorics 1 (1996) 1, 37–53.

D. WÄTJEN:
            Regulations of Uniformly k-Limited ET0L Systems and Their Relations to Controlled Context-Free Grammars.
            Journal of Automata, Languages and Combinatorics 1 (1996) 1, 55–74.

1 (1996) 2

I. BANÍK:
            Colonies as Systems of Turing Machines Without States.
            Journal of Automata, Languages and Combinatorics 1 (1996) 2, 81–96.

H. BORDIHN, H. FERNAU:
            Accepting Grammars and Systems via Context Condition Grammars.
            Journal of Automata, Languages and Combinatorics 1 (1996) 2, 97–112.

J. D. CURRIE, R. O. SHELTON:
            Cantor Sets and Dejean's Conjecture.
            Journal of Automata, Languages and Combinatorics 1 (1996) 2, 113–127.

J. JEDRZEJOWICZ:
            Undecidability Results for Shuffle Languages.
            Journal of Automata, Languages and Combinatorics 1 (1996) 2, 147–159.

P. HARTMANN:
            Implementation of Parallel Replacement Systems for Cellular Hypergraphs.
            Journal of Automata, Languages and Combinatorics 1 (1996) 2, 129–146.

1 (1996) 3

S. BOZAPALIDIS:
            Convex Algebras, Convex Modules and Formal Power Series on Trees.
            Journal of Automata, Languages and Combinatorics 1 (1996) 3, 165–180.

G. GEORGESCU:
            On the Regularity of Languages Generated by Parallel Communicating Grammar Systems.
            Journal of Automata, Languages and Combinatorics 1 (1996) 3, 181–197.

J. S. GOLAN, A. MATEESCU, D. VAIDA:
            Semirings and Parallel Composition of Processes.
            Journal of Automata, Languages and Combinatorics 1 (1996) 3, 199–217.

G. PĂUN, G. ROZENBERG, A. SALOMAA:
            Pattern Grammars.
            Journal of Automata, Languages and Combinatorics 1 (1996) 3, 219–235.

1 (1996) 4

H. FERNAU:
            Membership for k-Limited ET0L Languages is Not Decidable.
            Journal of Automata, Languages and Combinatorics 1 (1996) 4, 243–245.

S. GHILEZAN:
            Generalized Finiteness of Developments in Typed Lambda Calculi.
            Journal of Automata, Languages and Combinatorics 1 (1996) 4, 247–257.

R. KEMP:
            On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem.
            Journal of Automata, Languages and Combinatorics 1 (1996) 4, 259–303.

V. MITRANA:
            Iterated Pattern Languages.
            Journal of Automata, Languages and Combinatorics 1 (1996) 4, 305–311.


Homepage