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="Leung, Hing"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Measuring nondeterminism in pushdown automata
Jonathan Goldstine
,
Hing Leung
,
Detlef Wotschke
Journal of Computer and System Sciences
71
(4), 2005, pp. 440-466
Descriptional complexity of NFA of different ambiguity
Hing Leung
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 975-984
On factorization forests of finite height
Jérémie Chalopin
,
Hing Leung
Theoretical Computer Science
310
(1-3), 2004, pp. 489-499
The limitedness problem on distance automata: Hashiguchi's method revisited
Hing Leung
,
Viktor Podolskiy
Theoretical Computer Science
310
(1-3), 2004, pp. 147-158
Tight lower bounds on the size of sweeping automata
Hing Leung
Journal of Computer and System Sciences
63
(3), 2001, pp. 384-393
On the size of parsers and LR(
k
)-grammars
Hing Leung
,
Detlef Wotschke
Theoretical Computer Science
242
(1-2), 2000, pp. 59-69
On finite automata with limited nondeterminism
Hing Leung
Acta Informatica
35
(7), 1998, pp. 595-624
Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata
Hing Leung
SIAM Journal on Computing
27
(4), 1998, pp. 1073-1082
Measuring nondeterminism in pushdown automata
Jonathan Goldstine
,
Hing Leung
,
Detlev Wotschke
Lecture Notes in Computer Science
1200
, 1997, pp. 295-306
Separating exponentially ambiguous NFA from polynomially ambiguous NFA
Hing Leung
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 221-229
On the relation between ambiguity and nondeterminism in finite automata
Jonathan Goldstine
,
Hing Leung
,
Detlef Wotschke
Information and Computation
100
(2), 1992, October, pp. 261-270
On finite automata with limited nondeterminism
Hing Leung
Lecture Notes in Computer Science
629
, 1992, pp. 355-363
A note on finitely ambiguous distance automata
Hing Leung
Information Processing Letters
44
(6), 1992, pp. 329-331
Limitedness theorem on finite automata with distance functions: an algebraic proof
Hing Leung
Theoretical Computer Science
81
, 1991, pp. 137-145
On the relation between ambiguity and nondeterminism in finite automata
Jonathan Goldstine
,
Hing Leung
,
Detlef Wotschke
Technical Report (5/90), 1990