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: Author="Goldstine, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the equality of grammatical families
S. Ginsburg
,
J. Goldstine
,
E.H. Spanier
Journal of Computer and System Sciences
26
(2), 1983, April, pp. 171-196
A prime decomposition theorem for grammatical families
S. Ginsburg
,
J. Goldstine
,
E.H. Spanier
Journal of Computer and System Sciences
24
(3), 1982, June, pp. 315-361
A rational theory of AFLs
J. Goldstine
Lecture Notes in Computer Science
71
, 1979, pp. 271-281
Some uniformly erasable families of languages
S. Ginsburg
,
J. Goldstine
,
S. Greibach
Theoretical Computer Science
2
(1), 1976, pp. 29-44
Bounded AFLs
J. Goldstine
Journal of Computer and System Sciences
12
, 1976, pp. 399-419
Uniformly erasable AFL
S. Carlyle-Greibach
,
S. Ginsburg
,
J. Goldstine
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, STOC'72 (Denver, CO, May 1-3, 1972)
, 1972, pp. 207-213
Intersection-closed full AFL and the recursively enumerable languages
S. Ginsburg
,
J. Goldstine
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC'71 (Shaker Heights, OH, May 3-5, 1971)
, 1971, pp. 121-131