GitHub - unravyl/finite-automata-visualizer: A visualizer for generating DFA diagrams from regular expressions

demo_video.mp4

How To Access?

Go to our website and visualize your regular expression into a diagram!

User can input a regular expression, and the application will generate a definite finite automaton representation of it

User can input a string and regular expresson, and the application will check if the input string is a member of the regular expression

string-verification-demo.mp4

To know how the RegEx to DFA Diagram conversion works in detail, check out our wiki !

Name		Name	Last commit message	Last commit date
Latest commit History 341 Commits
.vscode		.vscode
app		app
classes		classes
components		components
constants		constants
data		data
interfaces		interfaces
public		public
store		store
styles		styles
tests		tests
utils		utils
.gitignore		.gitignore
.prettierignore		.prettierignore
.prettierrc		.prettierrc
README.md		README.md
next-env.d.ts		next-env.d.ts
next.config.mjs		next.config.mjs
package-lock.json		package-lock.json
package.json		package.json
postcss.config.mjs		postcss.config.mjs
tailwind.config.ts		tailwind.config.ts
tsconfig.json		tsconfig.json