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=J. Comput.~Syst.~Sci. AND Volume=18
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decomposable maps in general tessellation structures
J.T. Butler
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 1-7
Equivalence problem of non-deterministic finite automata
A. Nozaki
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 8-17
Some decision problems concerning sequential transducers and checking automata
E.M. Gurari
,
O.H. Ibarra
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 18-34
Analysis of Petri nets by stepwise refinements
R. Valette
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 35-46
Injectivity and surjectivity of parallel maps for cellular automata
A. Maruoka
,
M. Kimura
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 47-64
On the existence of minimal realizations of linear dynamical systems over Noetherian integral domains
Y. Rouchaleau
,
E.D. Sontag
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 65-75
Linear algorithms on recursive representations of trees
S.L. Mitchell
,
E.J. Cockayne
,
S.T. Hedetniemi
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 76-85
On the complexity of computations under varying sets of primitives
D.P. Dobkin
,
R.J. Lipton
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 86-91
Two decidability results for deterministic pushdown automata
M. Linna
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 92-107
A class of algorithms which require nonlinear time to maintain disjoint sets
R.E. Tarjan
Journal of Computer and System Sciences
18
(2), 1979, April, pp. 110-127
Graph isomorphism, general remarks
G.L. Miller
Journal of Computer and System Sciences
18
(2), 1979, April, pp. 128-142
Universal classes of hash functions
J.L. Carter
,
M.N. Wegman
Journal of Computer and System Sciences
18
, 1979, April, pp. 143-154
Fast probabilistic algorithms for Hamiltonian circuits and matchings
D. Angluin
,
L.G. Valiant
Journal of Computer and System Sciences
18
(2), 1979, April, pp. 155-193
Propositional dynamic logic of regular programs
M.J. Fischer
,
R.E. Ladner
Journal of Computer and System Sciences
18
(2), 1979, April, pp. 194-211
Optimal order for approximation of derivatives
A.G. Werschulz
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 213-217
On LL-regular grammars
D.A. Poplawski
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 218-227
Regular trees and the free iterative theory
S. Ginali
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 228-242
Undecidability of the first-order arithmetic a(p(x), 2x, x+1)
H. Ono
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 243-253
Monadic recursion schemes: the effect of constants
E.P. Friedman
,
S.A. Greibach
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 254-266
On the family of finite index matrix languages
G. Păun
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 267-280
Modifications of the program scheme model
E.J. Weyuker
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 281-293
Complexity classes of provable recursive functions
D. Gordon
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 294-303
Some remarks on multiple-entry finite automata
P.A.S. Veloso
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 304-306
Rational commutative trios
M. Latteux
Journal of Computer and System Sciences
18
(3), 1979, June, pp. 307-333