The concept of DAWGs is based on: Blumer, A. et al. (1985). The smallest automation recognizing the subwords of a text. Theoretical Computer Science, 40, 31–55.
-
Updated
Sep 13, 2022 - Java
The concept of DAWGs is based on: Blumer, A. et al. (1985). The smallest automation recognizing the subwords of a text. Theoretical Computer Science, 40, 31–55.
Simple implementation of DAFSA minimization using Revuz's algorithm.
Scrabble game implemented using a microservices architecture. Technology stack: Spring (backend), Angular (frontend).
Add a description, image, and links to the dawg topic page so that developers can more easily learn about it.
To associate your repository with the dawg topic, visit your repo's landing page and select "manage topics."