Download JAR files tagged by implementation with all dependencies

Unicode Emoji List for Java is a comprehensive library that provides easy access to the vast world of Unicode emojis. This project aims to offer a user-friendly API for retrieving and utilizing emoji characters and their metadata within Java applications. The library covers a wide range of emojis as defined in the latest Unicode standards, ensuring compatibility and up-to-date representation of emojis across different platforms and devices. Whether for enhancing text processing capabilities, developing chat applications, or for any project requiring emoji support, Unicode Emoji List for Java delivers a robust and reliable solution. Its straightforward implementation allows for seamless integration into existing Java projects, fostering creativity and expanding the expressive potential of digital communication.

This artifact provides the implementation of (a blue-fringe version of) the "regular positive negative inference" (RPNI) learning algorithm as presented in the paper "Inferring regular languages in polynomial update time" (https://dx.doi.org/10.1142/9789812797902_0004) by Jose Oncina and Pedro García using the "minimum description length" (MDL) heuristic. More details on this algorithm can be found in the book "Grammatical Inference" (https://doi.org/10.1017/CBO9781139194655) by Colin de la Higuera.

This artifact provides the implementation of (a blue-fringe version of) the "regular positive negative inference" (RPNI) learning algorithm as presented in the paper "Inferring regular languages in polynomial update time" (https://dx.doi.org/10.1142/9789812797902_0004) by Jose Oncina and Pedro García using the "evidence-driven state merging" (EDSM) heuristic. More details on this algorithm can be found in the book "Grammatical Inference" (https://doi.org/10.1017/CBO9781139194655) by Colin de la Higuera.

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 artifact provides the implementation of the model checker presented in the paper "M3C: Modal Meta Model Checking" (https://dx.doi.org/10.1007/978-3-030-00244-2_15) by Bernhard Steffen and Alnis Murtovi. The paper is based on "Model Checking for Context-Free Processes" (https://link.springer.com/chapter/10.1007/BFb0084787) by Olaf Burkart and Bernhard Steffen. Note that this implementation requires a runtime dependency to a specific ADDLib backend (see https://add-lib.scce.info/), which is not explicitly included in this artifact due to packaging reasons.