A web-based project that converts regular expressions into Deterministic Finite Automata (DFA), Context-Free Grammars (CFG), and Pushdown Automata (PDA) ...
Abstract: A Regular Expression, often abbreviated as Regex, are a sequence of characters that define a search pattern. An Non-deterministic Finite Automata (NFA) is a computational machine which can ...
Created using Golang, Docker, PostgresSQL, Redis, Prometheus, Grafana. This project demonstrates usage of Golang with REST APIs to convert regular expressions to epsilon-Non Deterministic Finite (eNFA ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback