Tree size reduction with keeping distinguishability
- 21 November 2018
- journal article
- conference paper
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 749, 26-35
- https://doi.org/10.1016/j.tcs.2017.08.017
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61502121, 61402130)
- China Postdoctoral Science Foundation (2016M590284)
- Fundamental Research Funds for the Central Universities (HIT.NSRIF.201649)
- National Grand Fundamental Research 973 Program of China (2012CB316200)
- Heilongjiang Postdoctoral Foundation (LBH-Z15094)
This publication has 14 references indexed in Scilit:
- Learning Deterministic Regular Expressions for the Inference of Schemas from XML DataACM Transactions on the Web, 2010
- Inference of concise regular expressions and DTDsACM Transactions on Database Systems, 2010
- On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic ApplicationsSIAM Journal on Computing, 2010
- XPath leashedACM Computing Surveys, 2009
- Learning (k,l)-contextual tree languages for information extraction from web pagesMachine Learning, 2008
- Information ExtractionFoundations and Trends® in Databases, 2007
- Interactive learning of node selecting tree transducerMachine Learning, 2006
- Containment and equivalence for a fragment of XPathJournal of the ACM, 2004
- Tree pattern query minimizationThe VLDB Journal, 2002
- Bit transposition for very large scientific and statistical databasesAlgorithmica, 1986