Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The limited regular languages
C.-J. Tang
,
Y.-L. Zhang
Theoretical Computer Science
23
(1), 1983, pp. 1-10
Logical foundation approach to users' domain restriction in data bases
A. Jankowski
,
C. Rauszer
Theoretical Computer Science
23
(1), 1983, pp. 11-36
Pictures of functions and their acceptability by automata
A. Nakamura
,
H. Ono
Theoretical Computer Science
23
(1), 1983, pp. 37-48
A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages
S. Heilbrunner
Theoretical Computer Science
23
(1), 1983, pp. 49-68
Uniformly growing k-th power-free homomorphisms
F.-J. Brandenburg
Theoretical Computer Science
23
(1), 1983, pp. 69-82
DOL schemes and the periodicity of string embeddings
T. Head
,
G. Thierrin
,
J. Wilkinson
Theoretical Computer Science
23
(1), 1983, pp. 83-89
On satisfying the LL-iteration theorem
A. Nijholt
Theoretical Computer Science
23
(1), 1983, pp. 91-94
On the finite-valuedness problem for sequential machines
T.-H. Chan
,
O.H. Ibarra
Theoretical Computer Science
23
(1), 1983, pp. 95-101
A counterexample of Shyamasundar's characterization of pushdown permuters
P.V. Ramanan
Theoretical Computer Science
23
(1), 1983, pp. 103-105
Stationary deterministic flows in discrete systems I
E. Gelenbe
Theoretical Computer Science
23
(2), 1983, pp. 107-127
A direct branching algorithm for checking equivalence of strict deterministic vs.
LL(k)
grammars
E. Tomita
Theoretical Computer Science
23
(2), 1983, pp. 129-154
On depth in EDTOL languages
G.S. Eisman
Theoretical Computer Science
23
(2), 1983, pp. 155-169
On the asymptotic complexity of rectangular matrix multiplication
G. Lotti
,
F. Romani
Theoretical Computer Science
23
(2), 1983, pp. 171-185
A continuous semantics for unbounded nondeterminism
R.J.R. Back
Theoretical Computer Science
23
(2), 1983, pp. 187-210
Primality testing and factoring
J. Finn
,
K. Leiberherr
Theoretical Computer Science
23
(2), 1983, pp. 211-215
A note on
\omega
-regular languages
M. Takahashi
,
H. Yamasaki
Theoretical Computer Science
23
(2), 1983, pp. 217-225
On a family of
L
languages resulting from systolic tree automata
K. Culik II
,
J. Gruska
,
A. Salomaa
Theoretical Computer Science
23
(3), 1983, pp. 231-242
Super-Nets and their hierarchy
T. Etzion
,
M. Yoeli
Theoretical Computer Science
23
(3), 1983, pp. 243-272
The largest tree in a random graph
A. Marchetti-Spaccamela
,
M. Protasi
Theoretical Computer Science
23
(3), 1983, pp. 273-286
Real functions and numbers defined by Turing machines
R. Freund
Theoretical Computer Science
23
(3), 1983, pp. 287-304
Computation of recursive functionals using minimal initial segments
D. Gordon
,
E. Shamir
Theoretical Computer Science
23
(3), 1983, pp. 305-315
Kleene chain completeness and fixedpoint properties
T. Kamimura
,
A. Tang
Theoretical Computer Science
23
(3), 1983, pp. 317-331
Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first-order theories
H. Volger
Theoretical Computer Science
23
(3), 1983, pp. 333-337
Undecidable questions related to Church-Rosser Thue systems
C. O'DĂșnlaing
Theoretical Computer Science
23
(3), 1983, pp. 339-345