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: Series=LNCS AND Volume=62
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
States can sometimes do more than stack symbols in PDA's
J.K. Price
,
D. Wotschke
Lecture Notes in Computer Science
62
, 1978, pp. 353-362
Some decision results for recognizable sets in arbitrary monoids
A. Restivo
Lecture Notes in Computer Science
62
, 1978, pp. 363-371
Sur les séries rationnelles en variables non commutatives
C. Reutenauer
Lecture Notes in Computer Science
62
, 1978, pp. 372-381
On constructing efficient evaluators for attribute grammars
M. Saarinen
Lecture Notes in Computer Science
62
, 1978, pp. 382-397
Une extension de la théorie des types en
\lambda
-calcul
P. Sallé
Lecture Notes in Computer Science
62
, 1978, pp. 398-410
Parallel and nondeterministic time complexity classes
W. Savitch
Lecture Notes in Computer Science
62
, 1978, pp. 411-424
Multiterminal network flow and connectivity in unsymmetrical networks
C.P. Schnorr
Lecture Notes in Computer Science
62
, 1978, pp. 425-439
Admissible coherent c.p.o.'s
E. Sciore
,
A. Tang
Lecture Notes in Computer Science
62
, 1978, pp. 440-456
Integration of the phase-difference relations in asynchronous, sequential networks
T. Toffoli
Lecture Notes in Computer Science
62
, 1978, pp. 457-463
Self-modifying nets, a natural extension of Petri nets
R. Valk
Lecture Notes in Computer Science
62
, 1978, pp. 464-476
Head recurrent terms in combinatory logic: A generalization of the notion of head normal form
M. Venturini Zilli
Lecture Notes in Computer Science
62
, 1978, pp. 477-493
Characterization problems in the theory of inductive inference
R. Wiehagen
Lecture Notes in Computer Science
62
, 1978, pp. 494-508
Seiten
<
1
2