Download JAR files tagged by homing with all dependencies

This artifact provides the implementation of the L* learning algorithm described in the paper "Learning Regular Sets from Queries and Counterexamples" (https://doi.org/10.1016/0890-5401(87)90052-6) by Dana Angluin including variations and optimizations thereof such as the versions based on "On the Learnability of Infinitary Regular Sets" (https://dx.doi.org/10.1006/inco.1995.1070) by Oded Maler and Amir Pnueli or "Inference of finite automata using homing sequences" (http://dx.doi.org/10.1006/inco.1993.1021) by Ronald L. Rivest and Robert E. Schapire.

This library provides the necessary implementations to screen the following patterns: Bullish Belt Hold Bearish Belt Hold Hammer Hanging Man Southern Doji Northern Doji Gapping Up Doji Gapping Down Doji Takuri Line One Candle Shooting Star Bullish Strong Line Bearish Strong Line Bullish Harami Bearish Harami Bullish Engulfing Bearish Engulfing Bullish Kicking Bearish Kicking Matching Low Matching High Bullish Harami Cross Bearish Harami Cross Bullish Doji Star Bearish Doji Star Dark Cloud Cover Piercing Line Descending Hawk Homing Pigeon Bullish Abandoned Baby Bearish Abandoned Baby Three Inside Up Three Inside Down Three Outside Up Three Outside Down Three White Soldiers Three Black Crows Morning Doji Star Evening Doji Star Morning Star Evening Star Upside Tasuki Gap Downside Tasuki Gap Bullish Side by Side White Lines Bearish Side by Side White Lines Rising Three Method