default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHing Leung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[i1]Hing Leung:
A note on extended Euclid's algorithm. CoRR abs/1607.00106 (2016)
2000 – 2009
- 2009
- [j18]Hing Leung:
A Technique for Proving Lower Bounds on the Size of Sweeping Automata. J. Autom. Lang. Comb. 14(1): 93-105 (2009) - 2007
- [j17]Hing Leung, Giovanni Pighizzini
:
Preface. Theor. Comput. Sci. 387(2): 91-92 (2007) - 2006
- [c9]Hing Leung:
Structurally Unambiguous Finite Automata. CIAA 2006: 198-207 - [e1]Hing Leung, Giovanni Pighizzini:
8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings. New Mexico State University, Las Cruces, New Mexico, USA 2006 [contents] - 2005
- [j16]Hing Leung:
Descriptional complexity of nfa of different ambiguity. Int. J. Found. Comput. Sci. 16(5): 975-984 (2005) - [j15]Jonathan Goldstine, Hing Leung, Detlef Wotschke:
Measuring nondeterminism in pushdown automata. J. Comput. Syst. Sci. 71(4): 440-466 (2005) - 2004
- [j14]Hing Leung, Viktor Podolskiy:
The limitedness problem on distance automata: Hashiguchi's method revisited. Theor. Comput. Sci. 310(1-3): 147-158 (2004) - [j13]Jérémie Chalopin, Hing Leung:
On factorization forests of finite height. Theor. Comput. Sci. 310(1-3): 489-499 (2004) - [c8]Tsong Yueh Chen, Hing Leung, I. K. Mak:
Adaptive Random Testing. ASIAN 2004: 320-329 - [c7]Hing Leung:
Descriptional Complexity of NFAs of Different Ambiguity. DCFS 2004: 98-107 - 2002
- [j12]Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke:
Descriptional Complexity of Machines with Limited Resources. J. Univers. Comput. Sci. 8(2): 193-234 (2002) - 2001
- [j11]Hing Leung:
Tight Lower Bounds on the Size of Sweeping Automata. J. Comput. Syst. Sci. 63(3): 384-393 (2001) - [c6]Hing Leung, Viktor Podolskiy:
The Limitedness Problem on Distance Automata. DCFS 2001: 115-121 - 2000
- [j10]Hing Leung, T. H. Tse, F. T. Chan, Tsong Yueh Chen:
Test case selection with and without replacement. Inf. Sci. 129(1-4): 81-103 (2000) - [j9]Hing Leung:
On a Family of Nondeterministic Finite Automata. J. Autom. Lang. Comb. 5(3): 235-244 (2000) - [j8]Hing Leung, Detlef Wotschke:
On the size of parsers and LR(k)-grammars. Theor. Comput. Sci. 242(1-2): 59-69 (2000) - [c5]Hing Leung, Tsong Yueh Chen:
A Revisit of the Proportional Sampling Strategy. Australian Software Engineering Conference 2000: 247-254
1990 – 1999
- 1999
- [j7]Hing Leung, Tsong Yueh Chen:
A New Perspective of the Proportional Sampling Strategy. Comput. J. 42(8): 693-698 (1999) - 1998
- [j6]Hing Leung:
On Finite Automata with Limited Nondeterminism. Acta Informatica 35(7): 595-624 (1998) - [j5]Hing Leung:
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata. SIAM J. Comput. 27(4): 1073-1082 (1998) - 1997
- [c4]Jonathan Goldstine, Hing Leung, Detlef Wotschke:
Measuring Nondeterminism in Pushdown Automata. STACS 1997: 295-306 - 1995
- [j4]Hing Leung, Desh Ranjan, Héctor J. Hernández, D. T. Tang, Agustin González:
A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs. Inf. Process. Lett. 55(5): 279-282 (1995) - [c3]Tsong Yueh Chen, Hing Leung, Yuen-Tak Yu:
On the Analysis of Subdomain Testing Strategies. APSEC 1995: 218-224 - 1993
- [c2]Hing Leung:
Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA. ISAAC 1993: 221-229 - 1992
- [j3]Jonathan Goldstine, Hing Leung, Detlef Wotschke:
On the Relation between Ambiguity and Nondeterminism in Finite Automata. Inf. Comput. 100(2): 261-270 (1992) - [j2]Hing Leung:
A Note on Finitely Ambiguous Distance Automata. Inf. Process. Lett. 44(6): 329-331 (1992) - [c1]Hing Leung:
On Finite Automata with Limited Nondeterminism. MFCS 1992: 355-363 - 1991
- [j1]Hing Leung:
Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof. Theor. Comput. Sci. 81(1): 137-145 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
