Link to this article: http://journals.cambridge.org/abstract_S1351324911000064 How to cite this article: JOHANNA HÖGBERG (2011). A randomised inference algorithm for regular tree languages. AbstractWe present a randomised inference algorithm for regular tree languages. The algorithm takes as input two disjoint finite nonempty sets of trees P and N and outputs a nondeterministic finite tree automaton that accepts every tree in P and rejects every tree in N. The output automaton typically represents a nontrivial generalisation of the examples given in P and N. To obtain compact output automata, we use a heuristics similar to bisimulation minimisation. The algorithm has time complexity of O n N · n 2 P , where n N and n P are the size of N and P, respectively. Experiments are conducted on a prototype implementation, and the empirical results appear to second the theoretical results.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.