Volume 23,
1983
- Chang-jie Tang, Yi-li Zhang:
The Limited Regular Languages.
1-10
- Andrzej Jankowski, Cecylia Rauszer:
Logical Foundation Approach to Users' Domain Restriction in Data Bases.
11-36
- Akira Nakamura, Hiroakira Ono:
Pictures of Functions and Their Acceptability by Automata.
37-48
- Stephan Heilbrunner:
A Metatheorem for Undecidable Properties of Formal Languages and its Application to LRR and LLR Grammars and Languages.
49-68
- Franz-Josef Brandenburg:
Uniformly Growing k-TH Power-Free Homomorphisms.
69-82
- Tom Head, Gabriel Thierrin, John Wilkinson:
DOL Schemes and the Periodicity of String Embeddings.
83-89
- Anton Nijholt:
On Satisfying the LL-Iteration Theorem.
91-94
- Tat-hung Chan, Oscar H. Ibarra:
On the Finite-Valuedness Problem for Sequential Machines.
95-101
- Prakash V. Ramanan:
A Counterexample to Shyamasundar's Characterization of Pushdown Permuters.
103-105
- Erol Gelenbe:
Stationary Deterministic Flows in Discrete Systems I.
107-127
- Etsuji Tomita:
A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars.
129-154
- Gerald S. Eisman:
On Depth in Edtol Languages.
155-169
- Grazia Lotti, Francesco Romani:
On the Asymptotic Complexity of Rectangular Matrix Multiplication.
171-185
- Ralph-Johan Back:
A Continuous Semantics for Unbounded Nondeterminism.
187-210
- James Finn, Karl J. Lieberherr:
Primality Testing and Factoring.
211-215
- Masako Takahashi, Hideki Yamasaki:
A Note on omega-Regular Languages.
217-225
- Karel Culik II, Jozef Gruska, Arto Salomaa:
On a Family of L Languages Resulting from Systolic Tree Automata.
231-242
- Tuvi Etzion, Michael Yoeli:
Super-Nets and their Hierarchy.
243-272
- Alberto Marchetti-Spaccamela, Marco Protasi:
The Largest Tree in a Random Graph.
273-286
- Rudolf Freund:
Real Functions and Numbers Defined by Turing Machines.
287-304
- Dan Gordon, Eliahu Shamir:
Computation of Recursive Functionals Using Minimal Initial Segments.
305-315
- Tsutomu Kamimura, Adrian Tang:
Kleene Chain Completeness and Fixedpoint Properties.
317-331
- Hugo Volger:
Turing Machines with Linear Alternation, Theories of Bounded Concatenation and the Decision Problem of First Order Theories.
333-337
Copyright © Fri Mar 12 17:33:05 2010
by Michael Ley (ley@uni-trier.de)
