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
[1]
Hilfe
Suche: Author="Greibach, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the IO-complexity and approximation languages
J.D.P. Rolim
,
S.A. Greibach
Information Processing Letters
28
(1), 1988, May, pp. 27-31
Matching and spanning in certain planar graphs
J.W. Carlyle
,
S.A. Greibach
,
A. Paz
Math. Systems Theory
16
, 1983, pp. 159-183
A polynomial time algorithm for deciding the equivalence problem for 2-tape deterministic finite state acceptors
E.P. Friedman
,
S.A. Greibach
SIAM Journal on Computing
11
(1), 1982, February, pp. 166-183
Superdeterministic PDAs: A subcase with a decidable inclusion problem
S.A. Greibach
,
E.P. Friedman
Journal of the ACM
27
(4), 1980, pp. 675-700
Reset machines
R.V. Book
,
C. Wrathall
,
S.A. Greibach
Journal of Computer and System Sciences
19
(3), 1979, December, pp. 256-276
Superdeterministic DPDAS: the method for accepting does affect decision problems
E.P. Friedman
,
S.A. Greibach
Journal of Computer and System Sciences
19
(1), 1979, August, pp. 79-117
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
Theory of formal languages: Origins and directions (invited paper)
S.A. Greibach
Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79 (San Juan, PR, October 29-31, 1979)
, 1979, pp. 66-90
Linearity is polynomially decidable for realtime pushdown store automata
S.A. Greibach
Information and Control
42
, 1979, pp. 27-37
Comparisons and reset machines
R.V. Book
,
S. Greibach
,
C. Wrathall
Lecture Notes in Computer Science
62
, 1978, pp. 113-124
On equivalence and subclass containment problems for deterministic context-free languages
E.P. Friedman
,
S.A. Greibach
Information Processing Letters
7
(6), 1978, October, pp. 287-290
Hierarchy theorems for two-way finite state transducers
S.A. Greibach
Acta Informatica
11
(1), 1978, pp. 89-101
One way finite visit automata
S.A. Greibach
Theoretical Computer Science
6
(2), 1978, pp. 175-221
Remarks on blind and partially blind one-way multicounter machines
S.A. Greibach
Theoretical Computer Science
7
(3), 1978, pp. 311-324
Visits, crosses, and reversals for nondeterministic off-line machines
S.A. Greibach
Information and Control
36
, 1978, pp. 174-216
Comments on universal and left universal grammars, context-sensitive languages, and context-free grammar forms
S.A. Greibach
Information and Control
39
, 1978, pp. 135-142
Control sets of context-free grammar forms
S.A. Greibach
Journal of Computer and System Sciences
15
(1), 1977, August, pp. 35-98
Some uniformly erasable families of languages
S. Ginsburg
,
J. Goldstine
,
S. Greibach
Theoretical Computer Science
2
(1), 1976, pp. 29-44
Remarks on the complexity of nondeterministic counter languages
S.A. Greibach
Theoretical Computer Science
1
(4), 1976, pp. 269-288
One counter languages and the IRS condition
S.A. Greibach
Journal of Computer and System Sciences
10
, 1975, pp. 237-247
Erasable context-free languages
S.A. Greibach
Information and Control
29
, 1975, pp. 301-326
Some restrictions on W-grammars
S.A. Greibach
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, STOC'74 (Seattle, WA, April 30 - May 2, 1974)
, 1974, pp. 256-265
Jump PDA's and hierarchies of deterministic context-free languages
S.A. Greibach
SIAM Journal on Computing
3
, 1974, pp. 111-127
Jump PDA's, deterministic context-free languages, principal AFDL's and polynomial time recognition
S. Greibach
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC'73 (Austin, TX, April 30 - May 2, 1973)
, 1973, pp. 20-28
The hardest context-free language
S.A. Greibach
SIAM Journal on Computing
2
, 1973, pp. 304-310
Seiten 1
2
>