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="Bucher, W."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the generation of powers by OS schemes
W. Bucher
Discrete Applied Mathematics
23
, 1989, pp. 33-43
A note on regular classes in special Thue systems
W. Bucher
Discrete Applied Mathematics
21
, 1988, pp. 199-205
Applications of an infinite square-free co-CFL
M.G. Main
,
W. Bucher
,
D. Haussler
Theoretical Computer Science
49
(2-3), 1987, pp. 113-119
A regularity test for dual bordered OS systems
W. Bucher
Acta Informatica
23
(3), 1986, pp. 245-253
On total regulators generated by derivation relations
W. Bucher
,
A. Ehrenfeucht
,
D. Haussler
Theoretical Computer Science
40
(2,3), 1985, pp. 131-148
On total regulators generated by derivation relations
W. Bucher
,
A. Ehrenfeucht
,
D. Haussler
Lecture Notes in Computer Science
194
, 1985, pp. 71-79
Applications of an infinite squarefree CO-CFL
M.G. Main
,
W. Bucher
,
D. Haussler
Lecture Notes in Computer Science
194
, 1985, pp. 404-412
Context-free complexity of finite languages
W. Bucher
,
H.A. Maurer
,
K. Culik II
Theoretical Computer Science
28
(3), 1984, pp. 277-285
It is decidable whether a regular language is pure context-free
W. Bucher
,
J. Hagauer
Theoretical Computer Science
26
(1,2), 1983, pp. 233-241
Two-symbol DOS systems generating regular languages
W. Bucher
Acta Informatica
20
(2), 1983, pp. 133-142
Concise description of finite languages
W. Bucher
,
H.A. Maurer
,
K. Culik II
,
D. Wotschke
Theoretical Computer Science
14
, 1981, pp. 227-246
A note on a problem in the theory of grammatical complexity (Note)
W. Bucher
Theoretical Computer Science
14
, 1981, pp. 337-344