A program to convert the given regular expression to Non Definite Automata (NFA)
-
Updated
Feb 3, 2019 - C++
A program to convert the given regular expression to Non Definite Automata (NFA)
Academic Lab Course of the 27th batch of Computer Science & Engineering | University of Rajshahi - 🇧🇩
This code does not include all valid web addresses because of several restrictions for the simplification purposes.
based on the idea of a grammar less language by using fixed states -regular grammar-
Loads images into a ring buffer to optimize memory load and then integrate several keypoint detectors such as HARRIS, FAST, BRISK and SIFT and compares them with regard to number of keypoints and speed.
TOC Compiler: the compiler of neat people!
Add a description, image, and links to the toc topic page so that developers can more easily learn about it.
To associate your repository with the toc topic, visit your repo's landing page and select "manage topics."