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 YEAR=1979
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on computational complexity of a statistical deducibility testing procedure
Ivan Kramosil
Lecture Notes in Computer Science
74
, 1979, pp. 337-345
Context free normal systems
Manfred Kudlek
Lecture Notes in Computer Science
74
, 1979, pp. 346-353
New proofs for jump DPDA's
Matti Linna
,
Martti Penttonen
Lecture Notes in Computer Science
74
, 1979, pp. 354-362
Synchronization and maximality for very pure subsemigroups of a free semigroup
Aldo de Luca
,
Antonio Restivo
Lecture Notes in Computer Science
74
, 1979, pp. 363-371
On the sets of minimal indices of partial recursive functions
G. Marandz̑jan
Lecture Notes in Computer Science
74
, 1979, pp. 372-374
Some remarks on Boolean sums
Kurt Mehlhorn
Lecture Notes in Computer Science
74
, 1979, pp. 375-380
On the propositional algorithmic logic
Grażyna Mirkowska
Lecture Notes in Computer Science
74
, 1979, pp. 381-389
Ch(k) grammars: A characterization of LL(k) languages
Anton Nijholt
,
Eljas Soisalon-Soininen
Lecture Notes in Computer Science
74
, 1979, pp. 390-397
A uniform approach to balanced binary and multiway trees
Th. Ottmann
,
D. Wood
Lecture Notes in Computer Science
74
, 1979, pp. 398-407
On the generative capacity of some classes of grammars with regulated rewriting
Gheorghe Pȃun
Lecture Notes in Computer Science
74
, 1979, pp. 408-414
Validity test for Floyd's operator-precedence parsing algorithms
Peter Ruz̑ic̑ka
Lecture Notes in Computer Science
74
, 1979, pp. 415-424
On the languages of bounded Petri nets
Peter H. Starke
Lecture Notes in Computer Science
74
, 1979, pp. 425-433
Dyck language
D_2
is not absolutely parallel
Miron Tegze
Lecture Notes in Computer Science
74
, 1979, pp. 434-442
Fixed points in the power-set algebra of infinite trees
Jerzy Tiuryn
Lecture Notes in Computer Science
74
, 1979, pp. 443-452
On relaxation rules in algorithmic logic
B.A. Trakhtenbrot
Lecture Notes in Computer Science
74
, 1979, pp. 453-462
L
-fuzzy functorial automata
Vȇra Trnková
Lecture Notes in Computer Science
74
, 1979, pp. 463-473
Schematics of structural parallel programming and its applications
G.E. Tseytlin
Lecture Notes in Computer Science
74
, 1979, pp. 474-481
On axiomatization of deterministic propositional dynamic logic
M.K. Valiev
Lecture Notes in Computer Science
74
, 1979, pp. 482-491
Bounded recursion and complexity classes
Klaus Wagner
Lecture Notes in Computer Science
74
, 1979, pp. 492-498
Characterization of rational and algebraic power series
Wolfgang Wechler
Lecture Notes in Computer Science
74
, 1979, pp. 499-507
A crossing measure for 2-tape Turing machines
Gerd Wechsung
Lecture Notes in Computer Science
74
, 1979, pp. 508-516
The complexity of lexicographic sorting and searching
Juraj Wiedermann
Lecture Notes in Computer Science
74
, 1979, pp. 517-522
An algebraic approach to concurrence
Józef Winkowski
Lecture Notes in Computer Science
74
, 1979, pp. 523-532
On multitape automata
Hideki Yamasaki
Lecture Notes in Computer Science
74
, 1979, pp. 533-541
A Turing machine oracle hierarchy
Stanislav Z̑ák
Lecture Notes in Computer Science
74
, 1979, pp. 542-551
Seiten
<
1
2
3
4
5
6
7
>